Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Cain, Alan J.
Oliver, Graham
Ruškuc, Nik
and
Thomas, Richard M.
2008.
Language and Automata Theory and Applications.
Vol. 5196,
Issue. ,
p.
149.
Scanlon, Thomas
2008.
Infinite finitely generated fields are biinterpretable with ℕ.
Journal of the American Mathematical Society,
Vol. 21,
Issue. 3,
p.
893.
Altinel, Tuna
and
Muranov, Alexey
2009.
Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle.
Journal of the Institute of Mathematics of Jussieu,
Vol. 8,
Issue. 4,
p.
623.
Nies, André
and
Semukhin, Pavel
2009.
Finite automata presentable abelian groups.
Annals of Pure and Applied Logic,
Vol. 161,
Issue. 3,
p.
458.
Cain, Alan J.
Oliver, Graham
Ruškuc, Nik
and
Thomas, Richard M.
2009.
Automatic presentations for semigroups.
Information and Computation,
Vol. 207,
Issue. 11,
p.
1156.
Kuske, Dietrich
Liu, Jiamou
and
Lohrey, Markus
2010.
The Isomorphism Problem on Classes of Automatic Structures.
p.
160.
Finkel, Olivier
and
Todorčević, Stevo
2010.
The isomorphism relation between tree-automatic Structures.
Central European Journal of Mathematics,
Vol. 8,
Issue. 2,
p.
299.
Khoussainov, Bakhadyr
and
Minnes, Mia
2010.
Logic Colloquium 2007.
p.
132.
Tsankov, Todor
2011.
The additive group of the rationals does not have an automatic presentation.
The Journal of Symbolic Logic,
Vol. 76,
Issue. 4,
p.
1341.
Kuske, Dietrich
2011.
Algebraic Foundations in Computer Science.
Vol. 7020,
Issue. ,
p.
257.
Finkel, Olivier
and
Todorčević, Stevo
2012.
A hierarchy of tree-automatic structures.
The Journal of Symbolic Logic,
Vol. 77,
Issue. 1,
p.
350.
Rabinovich, Alexander
and
Rubin, Sasha
2012.
Interpretations in Trees with Countably Many Branches.
p.
551.
Kruckman, Alex
Rubin, Sasha
Sheridan, John
and
Zax, Ben
2012.
A Myhill-Nerode theorem for automata with advice.
Electronic Proceedings in Theoretical Computer Science,
Vol. 96,
Issue. ,
p.
238.
Semukhin, Pavel
and
Stephan, Frank
2013.
Automatic models of first order theories.
Annals of Pure and Applied Logic,
Vol. 164,
Issue. 9,
p.
837.
Fijalkow, Nathanaël
and
Paperman, Charles
2014.
Mathematical Foundations of Computer Science 2014.
Vol. 8634,
Issue. ,
p.
279.
Kuske, Dietrich
2014.
Isomorphisms of scattered automatic linear orders.
Theoretical Computer Science,
Vol. 533,
Issue. ,
p.
46.
LASSERRE, CLÉMENT
2014.
R.J. THOMPSON’S GROUPSFANDTARE BI-INTERPRETABLE WITH THE RING OF THE INTEGERS.
The Journal of Symbolic Logic,
Vol. 79,
Issue. 3,
p.
693.
Zaid, Faried Abu
Grädel, Erich
Kaiser, Łukasz
and
Pakusa, Wied
2014.
Model-Theoretic Properties of ω-Automatic Structures.
Theory of Computing Systems,
Vol. 55,
Issue. 4,
p.
856.
WALSH, SEAN
2014.
LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC.
The Review of Symbolic Logic,
Vol. 7,
Issue. 1,
p.
84.
Jain, Sanjay
Khoussainov, Bakhadyr
Stephan, Frank
Teng, Dan
and
Zou, Siyuan
2014.
Computer Science - Theory and Applications.
Vol. 8476,
Issue. ,
p.
204.