Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems |
scientific article; zbMATH DE number 908463
| 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; zbMATH DE number 908463 |
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
0.8719674
0 references
0.8719674
0 references
0.8666533
0 references
0.8662542
0 references
0.8518996
0 references
0.8493512
0 references
0.8419843
0 references
0.84141153
0 references
