Remarks on generalized post correspondence problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1046, Issue , 1996, Pages 37-48

  Harju, T ^a   Karhumaki J ^a   Krob, D ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ALL SOLUTIONS; CARDINALITIES; MORPHISMS; POST CORRESPONDENCE PROBLEMS;

ARTIFICIAL INTELLIGENCE;

EID: 84948156083     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_4     Document Type: Conference Paper

References (15)

1. C. Choffiut and J. Karhumäki, Test sets for morphisms with bounded delay, Discrete Appl. Math. 12 (1985), 93-101.
2. V. Claus, Some remarks on PCP(k) and related problems, BuU. EATCS 12 (1980), 54-61.
3. K. Culik II and J. Karhumäki, On the equality sets for homomorphisms on free monoids with two generators, RAIRO Theoret. Informatics 14 (1980), 349-369.
4. A. Ehrenfeucht, J. Karhumäki and G. Rozenberg, The (generalized) Post Correspondence Problem with lists consisting of two words is decidable, Theoret. Comput. Sci. 21 (1982), 119-144.
5. A. Ehrenfeucht, J. Karhumäki and G. Rozenberg, On binary equality languages and a solution to the test set conjecture in the binary case, J. Algebra, 85 (1983), 76-85.
6. S. Eilenberg, Automata, Languages, and Machines, Vol. A, Academic Press, New York, 1974.
7. M. Jantzen, "Confluent String Rewriting," Springer-Verlag, 1988.
8. A. A. Markov, On the impossibility of certain algorithms in the theory of associative systems, Dokl. Acad. Nauk. 55 (1947), 353-356 (Russian).
9. J. Matijacevic, Simple examples of usolvable associative calculi, Dokl. Akad. Nauk 173 (1967), 1264-1266 (Russian).
10. J.J. Pansiot, A note on Post's Correspondence Problem, Inform, proc. Lett. 12 (1981), 233.
11. V.A. Pavlenko, Post combinatorial problem with two pairs of words, Dokl. Akad. Nauk. Ukr. SSR (1981), 9-11.
12. E. Post, A variant of a recursively unsolvable problem, Bulletin of Amer. Math. Soc. 52 (1946), 264-268.
13. E. Post, Recursive unsolvability of a problem of Thue, J. Symb. Logic 12 (1947), 1-11.
14. K. Ruohonen, Reversible machines and Post's correspondence problem for biprefix morphisms, J. Inform. Process, Cybernet. EIK 21 (1985), 579-595.
15. G.C. Tzeitin, Associative calculus with an unsolvable equivalence problem, Tr. Aíat. Inst. Akad. Nauk 52 (1958), 172-189 (Russian).