Rational tree morphisms and transducer integer sequences: definition and examples
Journal of integer sequences, Tome 10 (2007) no. 4
The notion of transducer integer sequences is considered through a series of examples (the chosen examples are related to the Tower of Hanoi problem on 3 pegs). By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite transducers encoding rational tree morphisms (length and prefix preserving transformations of words that have only finitely many distinct sections).
Keywords:
transducers, integer sequences, automatic sequences, self-similar groups, selfsimilar semigroups, tower of Hanoi problem
@article{JIS_2007__10_4_a2,
author = {Sunic, Zoran},
title = {Rational tree morphisms and transducer integer sequences: definition and examples},
journal = {Journal of integer sequences},
year = {2007},
volume = {10},
number = {4},
zbl = {1165.11086},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2007__10_4_a2/}
}
Sunic, Zoran. Rational tree morphisms and transducer integer sequences: definition and examples. Journal of integer sequences, Tome 10 (2007) no. 4. http://geodesic.mathdoc.fr/item/JIS_2007__10_4_a2/