Author:
Halava Vesa,Harju Tero,Karhumäki Juhani,Latteux Michel
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. The (generalized) Post Correspondence Problem with lists consisting of two words is decidable;Ehrenfeucht;Theoret. Comput. Sci.,1982
2. V. Halava, The Post Correspondence Problem for marked morphisms, Ph.D. Thesis, Department of Math., Univ. of Turku, TUCS Dissertations no. 37, 2002
3. Infinite solutions of the marked Post Correspondence Problem;Halava,2002
4. Infinite post correspondence is undecidable for instance of size 9;Halava;Theor. Inform. Appl.,2006
5. Generalized Post Correspondence Problem for marked morphisms;Halava;Internat. J. Algebra Comput.,2000
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献