Cobham's Theorem seen through Büchi's Theorem
From MaRDI portal
Publication:4630271
DOI10.1007/3-540-56939-1_83zbMATH Open1422.68156OpenAlexW1539154263MaRDI QIDQ4630271FDOQ4630271
Authors: Christian Michaux, Roger Villemaire 
Publication date: 29 March 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56939-1_83
Recommendations
- On Cobham's theorem
- Cobham's theorem and its extensions
- A generalization of Cobham's theorem
- Une généralisation du théorème de Cobham
- A more reasonable proof of Cobham's theorem
- On the Cobham-Semenov theorem
- A strong version of Cobham’s theorem
- scientific article
- An extension of the Cobham-Semënov Theorem
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30) Automata sequences (11B85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the base-dependence of sets of numbers recognizable by finite automata
- Title not available (Why is that?)
- Weak Second‐Order Arithmetic and Finite Automata
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
- A decision method for the recognizability of sets defined by number systems
- ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Cobham's Theorem seen through Büchi's Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630271)
