Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words

Turlough Neary. Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words. In Ernst W. Mayr, Nicolas Ollinger, editors, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. Volume 30 of LIPIcs, pages 649-661, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.