This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
 Ben Green and Imre Z. Ruzsa , Freiman's theorem in an arbitrary abelian group, Journal of the London Mathematical Society. Second Series, vol. 75 (2007), no. 1, pp. 163–175.
 Bernard R. Hodgson , On direct products of automaton decidable theories, Theoretical Computer Science, vol. 19 (1982), no. 3, pp. 331–335.
 Bakhadyr Khoussainov and Anil Nerode , Automatic presentations of structures, Logic and computational complexity (Indianapolis, IN, 1994), Lecture Notes in Computer Science, vol. 960, Springer, Berlin, 1995, pp. 367–392.
 Bakhadyr Khoussainov , André Nies , Sasha Rubin , and Frank Stephan , Automatic structures: richness and limitations, Logical Methods in Computer Science, vol. 3 (2007), no. 2:2, 18 pp. (electronic).
 André Nies and Pavel Semukhin , Finite automata presentable abelian groups, Logical foundations of computer science ( A. Nerode and S. Artemov , editors), Lecture Notes in Computer Science, vol. 4514, Springer, Berlin, 2007, pp. 422–436.
 André Nies and Richard M. Thomas , FA-presentable groups and rings, Journal of Algebra, vol. 320 (2008), no. 2, pp. 569–585.
 Graham P. Oliver and Richard M. Thomas , Automatic presentations for finitely generated groups, STACS 2005 ( V. Diekert and B. Durand , editors), Lecture Notes in Computer Science, vol. 3404, Springer, Berlin, 2005, pp. 693–704.
 I. Z. Ruzsa , Generalized arithmetical progressions and sumsets, Acta Mathematica Hungarica, vol. 65 (1994), no. 4, pp. 379–388.
 Terence Tao and Van Vu , Additive combinatorics, Cambridge Studies in Advanced Mathematics, vol. 105, Cambridge University Press, Cambridge, 2006.