Formal Languages, Automata and Numeration Systems 2
From MaRDI portal
Publication:5252468
DOI10.1002/9781119042853zbMath1326.68003MaRDI QIDQ5252468
Publication date: 1 June 2015
Full work available at URL: https://doi.org/10.1002/9781119042853
numeration systems; decidability; finite automata; formal languages; combinatorics on words; automata sequences; abstract numeration systems; morphic sequences
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68R15: Combinatorics on words
68Q45: Formal languages and automata
11U05: Decidability (number-theoretic aspects)
11B85: Automata sequences
11-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory
11A67: Other number representations
Related Items
General Framework, First-Order Logic and Numeration Systems, The Formal Inverse of the Period-Doubling Sequence, Unnamed Item, Ultimate periodicity problem for linear numeration systems, Borel complexity of sets of normal numbers via generic points in subshifts with specification, Automaticity and Invariant Measures of Linear Cellular Automata, From Combinatorial Games to Shape-Symmetric Morphisms, Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders, Automatic sequences: from rational bases to trees, 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, Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents, Counting the number of non-zero coefficients in rows of generalized Pascal triangles, Deciding game invariance, The signature of rational languages, Morphic sequences versus automatic sequences, Convergence of Pascal-like triangles in Parry-Bertrand numeration systems, Automatic sequences based on Parry or Bertrand numeration systems, Minimal automaton for multiplying and translating the Thue-Morse set, Automatic winning shifts, Effective S-adic Symbolic Dynamical Systems, Complementary symmetric Rote sequences: the critical exponent and the recurrence function
