Tree morphisms, transducers, and integer sequences

Simple item page
dc.creatorSunic, Zoran
dc.date2006-12-04
dc.date.accessioned2026-07-07T07:34:37Z
dc.date.available2026-07-07T07:34:37Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/math/0612080
dc.identifierhttp://arxiv.org/abs/math/0612080
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119828
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject11Y55, 11B85, 20M20, 20M35
dc.titleTree morphisms, transducers, and integer sequences
dc.typetext

Files

Collections

arXiv