Generalization of automatic sequences for numeration systems on a regular language
From MaRDI portal
Publication:1575724
DOI10.1016/S0304-3975(00)00163-8zbMath0945.68105MaRDI QIDQ1575724
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Asymptotic properties of free monoid morphisms ⋮ Decidability questions related to abstract numeration systems ⋮ Properties and limits of recognition of sets of integers by countable automata ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Automatic sequences based on Parry or Bertrand numeration systems ⋮ Multidimensional generalized automatic sequences and shape-symmetric morphic words ⋮ Self-generating sets, integers with missing blocks, and substitutions ⋮ A Characterization of Multidimensional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>S</mml:mi></mml:math>-Automatic Sequences ⋮ The growth function of \(S\)-recognizable sets ⋮ Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series ⋮ Automatic Sequences and Generalised Polynomials ⋮ Decimations of languages and state complexity ⋮ About frequencies of letters in generalized automatic sequences ⋮ Regular sequences and synchronized sequences in abstract numeration systems ⋮ On the complexity of a family of \(k\)-context-free sequences ⋮ Entropy rates and finite-state dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length)
- A generalization of automatic sequences
- Folds!
- Confluent linear numeration systems
- On the complexity of infinite sequences
- Numeration systems, linear recurrences, and regular sets
- Greedy numeration systems and regularity
- Bertrand numeration systems and recognizability
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Uniform tag sequences
- Numeration systems on a regular language
