Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Book, R.V. and Brandenburg, F.J., Equality sets and complexity classes, SIAM J. of Comp., to appear.
Culik, K., II, A purely homomorphic characterization of recursively enumerable sets, J. of the ACM26, 345–450, 1979.
Claus, V., Die Grenze zwischen Entscheidbarkeit und Nichtentscheidbarkeit, Fernstudienkurs für die Fernuniversität Hagen, Open University Hagen, 1979.
Culik, K., II and Karhumaki, J., On the equality sets for homomorphisms on free monoids with two generators, University of Waterloo, Techn.Rep. CS-79-17, 1979.
Engelfriet, J. and Rozenberg, G., Fixed point languages, equality languages and representations of recursively enumerable languages, J. of the ACM, to appear.
Ehrenfeucht, A., Karhumaki, J. and Rozenberg, G., The (Generalized) Post Correspondence Problem with lists of length 2 is decidable, manuscript.
Harrison, M.A., Introduction to formal language theory, Addison-Wesley Publ., 1978.
Hopcroft, J.E. and Ullman, J.D., Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publ., 1979.
Karhumaki, J. and Simon, I., A note on elementary homomorphisms and the regularity of equality sets, Bulletin of the EATCS 9, 1979.
Lecerf, Y., Recursive insolubilité de l'equation generale de diagonalisation de deux momomorphisms de monoides libres ωx = ωx, Comptes rendus 257, 2940–2943, 1963.
Post, E.L., A variant of a recursively unsolvable problem, Bull. of the Am. Math. Soc., 52, 264–268, 1946.
Salomaa, A., Formal languages, Academic Press, 1973.
Salomaa, A., Equality sets for homomorphisms on free monoids, Acta Cybernetica-4, 127–139, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehrenfeucht, A., Rozenberg, G. (1981). On the (generalized) post correspondence problem with lists of length 2. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_33
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive