The growth function of \(S\)-recognizable sets
From MaRDI portal
Publication:719280
DOI10.1016/J.TCS.2011.05.057zbMath1222.68100arXiv1101.0036OpenAlexW2962987831MaRDI QIDQ719280
Émilie Charlier, Narad Rampersad
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.0036
Related Items (4)
Asymptotic properties of free monoid morphisms ⋮ First-Order Logic and Numeration Systems ⋮ Unnamed Item ⋮ Minimal automaton for multiplying and translating the Thue-Morse set
Uses Software
Cites Work
- Multidimensional generalized automatic sequences and shape-symmetric morphic words
- Generalization of automatic sequences for numeration systems on a regular language
- Construction of regular languages and recognizability of polynomials
- Syndeticity and independent substitutions
- Multi-dimensional sets recognizable in all abstract numeration systems
- Automatic Sequences
- Characterizing regular languages with polynomial densities
- Numeration systems on a regular language
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The growth function of \(S\)-recognizable sets