On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
From MaRDI portal
Publication:3519495
DOI10.1007/978-3-540-70583-3_10zbMath1155.03308OpenAlexW2060372782MaRDI QIDQ3519495
Julien Brusten, Bernard Boigelot, Véronique Bruyère
Publication date: 19 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_10
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (3)
Cobham's theorem for substitutions ⋮ A Generalization of Semenov’s Theorem to Automata over Real Numbers ⋮ An analogue of Cobham's theorem for graph directed iterated function systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logic and \(p\)-recognizable sets of integers
- The Büchi Complementation Saga
- An effective decision procedure for linear arithmetic over the integers and reals
- A Generalization of Cobham’s Theorem to Automata over Real Numbers
- On the base-dependence of sets of numbers recognizable by finite automata
- Testing and generating infinite sequences by a finite automaton
- Don’t Care Words with an Application to the Automata-Based Approach for Real Addition
This page was built for publication: On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
