Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Culik II, K.: A purely homomorphic characterization of recursively enumerable sets. J. ACM 26(2), 345–350 (1979)
2. Ehrenfeucht, A., Karhumäki, J., Rozenberg, G.: The (generalized) Post Correspondence Problem with lists consisting of two words is decidable. Theoretical Computer Science 21, 119–144 (1982)
3. Hadravová, J.: A length bound for binary equality words. Comment. Math. Univ. Carolinae (to appear)
4. Lecture Notes in Computer Science;J. Hadravová,2008
5. Halava, V., Harju, T., Hirvensalo, M.: Binary (generalized) post correspondence problem. Theoretical Computer Science 276(1-2), 183–204 (2002)