Author:
Halava Vesa,Harju Tero,Hirvensalo Mika
Publisher
Springer Berlin Heidelberg
Reference5 articles.
1. A. Ehrenfeucht, J. Karhumäki, and G. Rozenberg. The (generalized) Post correspondence problem with lists consisting of two words is decidable. Theoretical Computer Science, 21(2):119–144, 1982.
2. V. Halava, M. Hirvensalo and R. de Wolf. Decidability and Undecidability of Marked PCP. STACS’99 (C. Meinel and S. Tison, eds.), Lecture Notes in Comput. Sci, vol 1563, Springer-Verlag, 1999, pp. 207–216.
3. T. Harju and J. Karhumäki. Morphisms. In Handbook of Formal Languages, volume 1, 439–510. edited by G. Rozenberg and A. Salomaa, eds. Springer-Verlag, Berlin, 1997.
4. Y. Matiyasevich and G. Sènizergues. Decision problems for semi-Thue systems with a few rules. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science, pages 523–531, 1996.
5. E. L. Post. A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52:264–268, 1946.