Tree morphisms, transducers, and integer sequences
Sunic, Zoran
Original · EN
The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms (length and prefix preserving transformations of words). Transducer integer sequences are related to the notion of self-similar groups and semigroups, as well as to the notion of automatic sequences.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.