A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems

DOI10.1007/978-3-540-85238-4_19zbMath1173.68548OpenAlexW2149249185MaRDI QIDQ3599131

Émilie Charlier, Michel Rigo

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other number representations (11A67)

Cites Work

• How to write integers in a non-integral basis
• Numeration systems, linear recurrences, and regular sets
• Greedy numeration systems and regularity
• Minimal DFA for testing divisibility
• A decision method for the recognizability of sets defined by number systems
• A theorem of Cobham for non-primitive substitutions
• On the base-dependence of sets of numbers recognizable by finite automata
• Numeration systems on a regular language
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems