Formal Languages, Automata and Numeration Systems 1
From MaRDI portal
Publication:2936963
DOI10.1002/9781119008200zbMath1326.68002OpenAlexW4251597913MaRDI QIDQ2936963
Publication date: 7 January 2015
Full work available at URL: https://doi.org/10.1002/9781119008200
numeration systemssymbolic dynamicsfinite automataformal languagescombinatorics on wordsmorphic sequencessequence complexities
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Automata sequences (11B85)
Related Items (12)
Asymptotic properties of free monoid morphisms ⋮ Hidden automatic sequences ⋮ Spectral theory of regular sequences ⋮ A simple approach to minimal substitution subshifts ⋮ Abelian combinatorics on words: a survey ⋮ The carry propagation of the successor function ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Relations on words ⋮ Convergence of Pascal-like triangles in Parry-Bertrand numeration systems ⋮ The polynomial endomorphisms of graph algebras ⋮ Computing the \(k\)-binomial complexity of the Thue-Morse word ⋮ The Formal Inverse of the Period-Doubling Sequence
This page was built for publication: Formal Languages, Automata and Numeration Systems 1
