Formal Languages, Automata and Numeration Systems 2

DOI10.1002/9781119042853zbMath1326.68003OpenAlexW4241061106MaRDI QIDQ5252468

Michel Rigo

Publication date: 1 June 2015

Full work available at URL: https://doi.org/10.1002/9781119042853

zbMATH Keywords

numeration systemsdecidabilityfinite automataformal languagescombinatorics on wordsautomata sequencesabstract numeration systemsmorphic sequences

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Combinatorics on words (68R15) Formal languages and automata (68Q45) Decidability (number-theoretic aspects) (11U05) Automata sequences (11B85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Other number representations (11A67)

Related Items (25)

Morphic sequences versus automatic sequences ⋮ Effective S-adic Symbolic Dynamical Systems ⋮ Ultimate periodicity problem for linear numeration systems ⋮ Automatic winning shifts ⋮ Automatic sequences: from rational bases to trees ⋮ Complementary symmetric Rote sequences: the critical exponent and the recurrence function ⋮ Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ String Attractors of Fixed Points of k-Bonacci-Like Morphisms ⋮ Automaticity and Parikh-Collinear Morphisms ⋮ Borel complexity of sets of normal numbers via generic points in subshifts with specification ⋮ Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents ⋮ General Framework ⋮ First-Order Logic and Numeration Systems ⋮ Unnamed Item ⋮ Automaticity and Invariant Measures of Linear Cellular Automata ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Counting the number of non-zero coefficients in rows of generalized Pascal triangles ⋮ Deciding game invariance ⋮ Convergence of Pascal-like triangles in Parry-Bertrand numeration systems ⋮ Automatic sequences based on Parry or Bertrand numeration systems ⋮ The signature of rational languages ⋮ Minimal automaton for multiplying and translating the Thue-Morse set ⋮ The Formal Inverse of the Period-Doubling Sequence ⋮ Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders

This page was built for publication: Formal Languages, Automata and Numeration Systems 2