Highly Influential

4 Excerpts

- Published 2007

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).

@inproceedings{Sunic2007RationalTM,
title={Rational Tree Morphisms and Transducer Integer Sequences: Definition and Examples},
author={Zoran Sunic},
year={2007}
}