Pages that link to "Item:Q1401169"
From MaRDI portal
The following pages link to The definable criterion for definability in Presburger arithmetic and its applications. (Q1401169):
Displayed 5 items.
- Semi-synchronous transductions (Q1006891) (← links)
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534) (← links)
- Structural Presburger digit vector automata (Q2378536) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS (Q3643584) (← links)