Cobham's Theorem seen through Büchi's Theorem

DOI10.1007/3-540-56939-1_83zbMath1422.68156OpenAlexW1539154263MaRDI QIDQ4630271

Roger Villemaire, Christian Michaux

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30) Automata sequences (11B85)

Related Items (2)

On the factors of automatic words ⋮ The definable criterion for definability in Presburger arithmetic and its applications.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
• Weak Second‐Order Arithmetic and Finite Automata
• A decision method for the recognizability of sets defined by number systems
• ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
• On the base-dependence of sets of numbers recognizable by finite automata

This page was built for publication: Cobham's Theorem seen through Büchi's Theorem