论文信息 - Word problem for deterministic and reversible semi-Thue systems - 字舞流文

Word problem for deterministic and reversible semi-Thue systems

We prove that the word problem for semi-Thue systems is undecidable for systems where the derivation is always deterministic and reversible for words containing a single occurrence of a letter from a given set.

Tero Harju | Vesa Halava | T. Harju | Vesa Halava

[1] Zohar Manna,et al. Mathematical Theory of Computation , 2003 .

[2] Emil L. Post. Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.

[3] Jean-Jacques Pansiot. A Note on Post's Correspondence Problem , 1981, Inf. Process. Lett..

[4] Juhani Karhumäki,et al. Noneffective Regularity of Equality Languages and Bounded Delay Morphisms , 2010, Discret. Math. Theor. Comput. Sci..

[5] Yuri V. Matiyasevich,et al. Decision problems for semi-Thue systems with a few rules , 2005, Theor. Comput. Sci..

[6] Charles H. Bennett,et al. Logical reversibility of computation , 1973 .

[7] Keijo Ruohonen,et al. Reversible Machines and Post's Correspondence Problem for Biprefix Morphisms , 1985, J. Inf. Process. Cybern..