A Generalization of Semenov’s Theorem to Automata over Real Numbers

DOI10.1007/978-3-642-02959-2_34zbMath1250.03061OpenAlexW2103500400MaRDI QIDQ5191120

Julien Brusten, Jérôme Leroux, Bernard Boigelot

Publication date: 28 July 2009

Published in: Automated Deduction – CADE-22 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02959-2_34

Mathematics Subject Classification ID

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

Related Items (7)

Decidability of Definability Issues in the Theory of Real Addition ⋮ Externally definable quotients and NIP expansions of the real ordered additive group ⋮ An asymptotic version of Cobham’s theorem ⋮ 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 ⋮ An analogue of Cobham's theorem for graph directed iterated function systems

Uses Software

• LASH
• LIRA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of Cobham's theorem to automata over real numbers
• The computational complexity of logical theories
• Presburgerness of predicates regular in two number systems
• Logic and \(p\)-recognizable sets of integers
• Efficient minimization of deterministic weak \(\omega\)-automata
• On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
• The Büchi Complementation Saga
• An effective decision procedure for linear arithmetic over the integers and reals
• On the base-dependence of sets of numbers recognizable by finite automata
• Don’t Care Words with an Application to the Automata-Based Approach for Real Addition

This page was built for publication: A Generalization of Semenov’s Theorem to Automata over Real Numbers