Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems |
scientific article |
Statements
Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (English)
0 references
11 March 1997
0 references
Presburger arithmetic
0 references
Cobham's theorem
0 references
Semenov's theorem
0 references
definability
0 references
recognizability by automata
0 references
0 references
