Cobham's Theorem seen through Büchi's Theorem
From MaRDI portal
(Redirected from Publication:4630271)
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; zbMATH DE number 3887825
- An extension of the Cobham-Semënov Theorem
Cites work
- A decision method for the recognizability of sets defined by number systems
- scientific article; zbMATH DE number 3841819 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3993564 (Why is no real title available?)
- ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
- On the base-dependence of sets of numbers recognizable by 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
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(7)- Independent numeration systems and syndeticity
- On the factors of automatic words
- The definable criterion for definability in Presburger arithmetic and its applications.
- scientific article; zbMATH DE number 956480 (Why is no real title available?)
- scientific article; zbMATH DE number 3993564 (Why is no real title available?)
- Joining k- and l-recognizable sets of natural numbers
- Cobham’s Theorem and Automaticity
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)
