On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

DOI10.2168/LMCS-6(1:6)2010zbMath1189.03045OpenAlexW3102247653MaRDI QIDQ5190326

Bernard Boigelot, Julien Brusten, Véronique Bruyère

Publication date: 15 March 2010

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-6(1:6)2010

zbMATH Keywords

finite automatareal numbersCobham's theoremmixed real-integer arithmetic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (9)

Decidability of Definability Issues in the Theory of Real Addition ⋮ Automatic Sets of Rational Numbers ⋮ An asymptotic version of Cobham’s theorem ⋮ Unnamed Item ⋮ First-Order Logic and Numeration Systems ⋮ Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order ⋮ Substitutive systems and a finitary version of Cobham's theorem ⋮ Unnamed Item ⋮ An analogue of Cobham's theorem for graph directed iterated function systems

This page was built for publication: On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases