On the Recognizability of Self-generating Sets
From MaRDI portal
Publication:3182952
DOI10.1007/978-3-642-03816-7_45zbMath1250.68164MaRDI QIDQ3182952
Tomi Kärki, Anne Lacroix, Michel Rigo
Publication date: 16 October 2009
Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_45
68Q45: Formal languages and automata
Cites Work
- Logic and \(p\)-recognizable sets of integers
- Affinely recursive sets and orderings of languages.
- Self-generating sets, integers with missing blocks, and substitutions
- Representations of numbers and finite automata
- Automatic Sequences
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
- Numeration systems on a regular language
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item