A generalization of Cobham's theorem to automata over real numbers
From MaRDI portal
Publication:1014642
DOI10.1016/j.tcs.2008.12.051zbMath1172.68029OpenAlexW2140093467MaRDI QIDQ1014642
Julien Brusten, Bernard Boigelot
Publication date: 29 April 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://orbi.ulg.ac.be/handle/2268/34584
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
Decidability of Definability Issues in the Theory of Real Addition ⋮ On Multiplicative Independent Bases for Canonical Number Systems in Cyclotomic Number Fields ⋮ Automatic Sets of Rational Numbers ⋮ An asymptotic version of Cobham’s theorem ⋮ Unnamed Item ⋮ First-Order Logic and Numeration Systems ⋮ An analogue of Cobham’s theorem for fractals ⋮ A Generalization of Semenov’s Theorem to Automata over Real Numbers ⋮ Substitutive systems and a finitary version of Cobham's theorem ⋮ An analogue of Cobham's theorem for graph directed iterated function systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifier elimination for the reals with a predicate for the powers of two
- The field of reals with a predicate for the powers of two
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
- Presburgerness of predicates regular in two number systems
- Logic and \(p\)-recognizable sets of integers
- Counting the solutions of Presburger equations without enumerating them.
- Efficient minimization of deterministic weak \(\omega\)-automata
- An effective decision procedure for linear arithmetic over the integers and reals
- On the base-dependence of sets of numbers recognizable by finite automata
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: A generalization of Cobham's theorem to automata over real numbers
