Journal of Integer Sequences, Vol. 10 (2007), Article 07.4.3

Rational Tree Morphisms and Transducer Integer Sequences: Definition and Examples

Zoran Šunić
Department of Mathematics
Texas A&M University
College Station, TX 77843-3368


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

Full version:  pdf,    dvi,    ps,    latex    

(Concerned with sequences A003188 A005836 A038500 A055661 A057427 A060236 A060372 A060373 A060374 and A080846 .)

Received December 4 2006; revised version received April 10 2007. Published in Journal of Integer Sequences April 13 2007.

Return to Journal of Integer Sequences home page