References

  1. Gilbert Baumslag & Donald Solitar (1962): Some two-generator one-relator non-Hopfian groups. Bulletin of the American Mathematical Society 68, pp. 199–201, doi:10.1090/S0002-9904-1962-10745-9.
  2. Robert Berger (1966): The Undecidability of the Domino Problem. American Mathematical Society.
  3. Jérôme Olivier Durand-Lose & Maurice Margenstern (2007): Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings. Lecture Notes in Computer Science 4664. Springer.
  4. Chaim Goodman-Strauss (2000): Open Questions in Tilings. Unpublished.
  5. Chaim Goodman-Strauss (2010): A hierarchical strongly aperiodic set of tiles in the hyperbolic plane. Theoretical Computer Science 411(7-9), pp. 1085–1093, doi:10.1016/j.tcs.2009.11.018.
  6. Philip Hooper (1966): The undecidability of the Turing machine immortality problem. The Journal of Symbolic Logic 31, pp. 219–234, doi:10.2307/2269811.
  7. Emmanuel Jeandel (2012): On Immortal Configurations in Turing Machines. In: Proceeding of CIE 2012, Lecture Notes in Computer Science 7318. Springer-Verlag, pp. 334–343, doi:10.1007/978-3-642-30870-3_34.
  8. Abe Karass, Alfred Pietrowski & Donald Solitar (1973): Finite and infinite cyclic extensions of free groups. Journal of the Australian Mathematical Society 16, pp. 458–466, doi:10.1017/S1446788700015445.
  9. Jarkko Kari (1996): A small aperiodic set of Wang tiles. Discrete Mathematics 160(1-3), pp. 259–264. Available at http://dx.doi.org/10.1016/0012-365X(95)00120-L.
  10. Jarkko Kari (2007): The Tiling Problem Revisited. In: Durand-Lose & Margenstern, pp. 72–79. Available at http://dx.doi.org/10.1007/978-3-540-74593-8_6.
  11. Dietrich Kuske & Markus Lohrey (2005): Logical aspects of Cayley-graphs: the group case. Annals of Pure and Applied Logic 131(1-3), pp. 263–286, doi:10.1017/S1446788700015445.
  12. Douglas Lind & Brian Marcus (1995): An Introduction to Symbolic Dynamics and Coding. Cambridge, doi:10.1017/CBO9780511626302.
  13. Roger C. Lyndon & Paul E. Schupp (1977): Combinatorial group theory. Springer-Verlag.
  14. Walter Magnus (1932): Das Identitätsproblem für Gruppen mit einer definierenden Relation. Mathematische Annalen 1, pp. 295–307, doi:10.1007/BF01455888.
  15. Maurice Margenstern (2008): The domino problem of the hyperbolic plane is undecidable. Theoretical Computer Science 407(1-3), pp. 29–84, doi:10.1016/j.tcs.2008.04.038.
  16. Stephen Meskin (1972): Nonresidually Finite One-Relator Groups. Transactions of the American Mathematical Society 164, pp. 105–114, doi:10.1090/S0002-9947-1972-0285589-5.
  17. David E. Muller & Paul E. Schupp (1985): The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science 37, pp. 51–75, doi:10.1016/0304-3975(85)90087-8.
  18. Michael O. Rabin (1958): Recursive Unsolvability of Group Theoretic Problems. Annals of Mathematics 67(1), pp. pp. 172–194, doi:10.2307/1969933.
  19. Hao Wang (1961): Proving theorems by pattern recognition II. Bell System Technical Journal 40(1-3), pp. 1–41.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org