Tree morphisms, transducers, and integer sequences
classification
🧮 math.CO
math.NT
keywords
sequencesintegernotiontransducermorphismstreeautomataautomatic
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.