Iteration of maps by an automaton

DOI10.1016/0012-365X(94)90254-2zbMath0795.68158MaRDI QIDQ1318796

F. Michel Dekking

Publication date: 4 April 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

automatic sequencetag machine

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (15)

Asymptotic properties of free monoid morphisms ⋮ On the joint subword complexity of automatic sequences ⋮ Automata transformations of prefix decidable and decidable by Buchi superwords ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ Transducer degrees: atoms, infima and suprema ⋮ Transduction of automatic sequences and applications ⋮ Boundedness of oriented walks generated by substitutions ⋮ Equivalence of right infinite words ⋮ Modularity in the semilattice of \(\omega \)-words ⋮ Self-generating sets, integers with missing blocks, and substitutions ⋮ The equivalence problem for languages defined by transductions on D0L languages ⋮ ON UNIFORMLY RECURRENT MORPHIC SEQUENCES ⋮ The class of HDT0L sequences is closed with respect to rational functions ⋮ Primitive substitutive numbers are closed under rational multiplication ⋮ Automatic walks

Cites Work

• Quasicrystal Ising chain and automata theory
• Suites algébriques, automates et substitutions
• Marches sur les arbres homogènes suivant une suite substitutive
• Uniform tag sequences

This page was built for publication: Iteration of maps by an automaton