It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base

DOI10.1016/j.jnt.2004.06.005zbMath1074.11017OpenAlexW1989511011MaRDI QIDQ1773328

Juha Honkala

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

zbMATH Keywords

representation of integersCobham's theoremslender languages\(\mathbb N\)-rational references\(k\)-recognizability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability (number-theoretic aspects) (11U05) Algebraic theory of languages and automata (68Q70) Automata sequences (11B85)

Related Items (2)

Decidability questions related to abstract numeration systems ⋮ THE BASE PROBLEM FOR D0L PARIKH SETS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base