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.
D. R. Bean , Recursive Euler and Hamilton paths, Proceedings of the American Mathematical Society, vol. 55 (1976), no. 2, pp. 385–394.
C. H. Bennett , Logical reversibility of computation, IBM Journal of Research and Development, vol. 17 (1973), pp. 525–532.
A. Blumensath and E. Grädel , Finite presentations of infinite structures: Automata and interpretations, Theory of Computing Systems, vol. 37 (2004), no. 6, pp. 641–674.
P. Erdös , T. Grünwald , and E. Vazsonyi , Über Euler–Linien unendlicher Graphen, Journal of Mathematics and Physics, vol. 17 (1938), no. 2, pp. 59–75.
M. R. Garey , D. S. Johnson , and R. E. Tarjan , The planar Hamiltonian circuit problem is NP-complete, SIAM Journal on Computing, vol. 5 (1976), no. 4, pp. 704–714.
D. Harel , Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness, Journal of the Association for Computing Machinery, vol. 33 (1986), no. 1, pp. 224–248.
D. Harel , Hamiltonian paths in infinite graphs, Israel Journal of Mathematics, vol. 76 (1991), no. 3, pp. 317–336.
T. Hirst and D. Harel , Taking it to the limit: on infinite variants of NP-complete problems, Journal of Computer and System Sciences, vol. 53 (1996), pp. 180–193.
B. Khoussainov , A. Nies , S. Rubin , and F. Stephan , Automatic structures: richness and limitations. Logical Methods in Computer Science, vol. 3 (2007), no. 2, 2:2, 18 pp. (electronic).
B. Khoussainov , S. Rubin , and F. Stephan , Definability and regularity in automatic structures, STACS 2004, Lecture Notes in Computer Science, no. 2996, Springer, 2004, pp. 440–451.
B. Khoussainov , S. Rubin , and F. Stephan , Automatic linear orders and trees, ACM Transactions on Computational Logic, vol. 6 (2005), no. 4, pp. 675–700.
S. C. Kleene , Recursive predicates and quantifiers, Transactions of the American Mathematical Society, vol. 53 (1943), pp. 41–73.
O. Ly , Automatic graphs and D0L-sequences of finite graphs, Journal of Computer and System Sciences, vol. 67 (2003), no. 3, pp. 497–545.
H. Wang , Proving theorems by pattern recognition, Bell Systems Technilogical Journal, vol. 40 (1961), pp. 1–41.