2006/12/04 by Zoran Šunić, Zoran Sunic, Sunic, Zoran
Computer Science · Mathematics · #11B85 #11Y55 #20M20 #20M35 #Algorithms and Data Compression #Cellular Automata and Applications #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #math.CO #math.NT #msc:11B85 #msc:11Y55 #msc:20M20 #msc:20M35 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/0612080
arxiv created 2006/12/04 · openalex publication_date 2006/12/04 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.