Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Büchi, J. Richard
1990.
The Collected Works of J. Richard Büchi.
p.
459.
Büchi, J. Richard
1990.
The Collected Works of J. Richard Büchi.
p.
437.
Villemaire, Roger
1992.
The theory of 〈N, +, Vk, Vl〉 is undecidable.
Theoretical Computer Science,
Vol. 106,
Issue. 2,
p.
337.
Villemaire, Roger
1992.
STACS 92.
Vol. 577,
Issue. ,
p.
83.
Michaux, Christian
and
Villemaire, Roger
1993.
Automata, Languages and Programming.
Vol. 700,
Issue. ,
p.
325.
Michaux, Christian
and
Villemaire, Roger
1996.
Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems.
Annals of Pure and Applied Logic,
Vol. 77,
Issue. 3,
p.
251.
Point, F.
and
Bruyère, V.
1997.
On the cobham-semenov theorem.
Theory of Computing Systems,
Vol. 30,
Issue. 2,
p.
197.
Tantau, Till
2003.
Fundamentals of Computation Theory.
Vol. 2751,
Issue. ,
p.
400.
Point, Françoise
Rigo, Michel
and
Waxweiler, Laurent
2016.
Defining Multiplication in Some Additive Expansions of Polynomial Rings.
Communications in Algebra,
Vol. 44,
Issue. 5,
p.
2075.
Hieronymi, Philipp
and
Schulz, Christian
2022.
A strong version of Cobham’s theorem.
p.
1172.