Iteration of maps by an automaton

DOI10.1016/0012-365X(94)90254-2MaRDI QIDQ1318796zbMATH OpenFDO

Authors F. Michel Dekking

Publication date 4 April 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(94)90254-2

zbMATH Keywords

automatic sequencetag machine

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5799710
• Some methods for generating infinite sequences
• On sequences resulting from iteration of modified quadratic and palindromic mappings
• Enumeration and automatic sequences
• Automatic sequences

Cites work

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

Cited in

(22)

• The class of HDT0L sequences is closed with respect to rational functions
• Primitive substitutive numbers are closed under rational multiplication
• Automatic walks
• Some methods for generating infinite sequences
• On sequences resulting from iteration of modified quadratic and palindromic mappings
• Self-generating sets, integers with missing blocks, and substitutions
• Transducer degrees: atoms, infima and suprema
• Equivalence of right infinite words
• Modularity in the semilattice of \(\omega \)-words
• The undirected repetition threshold and undirected pattern avoidance
• Asymptotic properties of free monoid morphisms
• Automata transformations of prefix decidable and decidable by Buchi superwords
• scientific article; zbMATH DE number 5799710 (Why is no real title available?)
• ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
• Autonomous sequence generation
• scientific article; zbMATH DE number 2080937 (Why is no real title available?)
• The equivalence problem for languages defined by transductions on D0L languages
• Transduction of automatic sequences and applications
• Boundedness of oriented walks generated by substitutions
• L-systems for the boundaries of plane-filling folding curves
• Constructing morphisms for arithmetic subsequences of Fibonacci
• On the joint subword complexity of automatic sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318796)