It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
From MaRDI portal
Publication:1773328
DOI10.1016/j.jnt.2004.06.005zbMath1074.11017MaRDI QIDQ1773328
Publication date: 28 April 2005
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2004.06.005
representation of integers; Cobham's theorem; slender languages; \(\mathbb N\)-rational references; \(k\)-recognizability
68Q45: Formal languages and automata
11U05: Decidability (number-theoretic aspects)
68Q70: Algebraic theory of languages and automata
11B85: Automata sequences
Related Items
Cites Work
- Logic and \(p\)-recognizable sets of integers
- Numeration systems, linear recurrences, and regular sets
- Thin and slender languages
- Weak Second‐Order Arithmetic and Finite Automata
- Unrecognizable Sets of Numbers
- On the base-dependence of sets of numbers recognizable by finite automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item