GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS-Reference-Cited by-同舟云学术

GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS

Published:2000-12 Issue:06 Volume:10 Page:757-772
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

HALAVA VESA¹²,HARJU TERO¹,HIRVENSALO MIKA¹²

Affiliation:

1. Department of Mathematics, University of Turku, FIN-20014, Turku, Finland

2. Turku Centre for Computer Science, Turku, Finland

Abstract

We prove that the generalized Post Correspondence Problem (GPCP) is decidable for marked morphisms. This result gives as a corollary a shorter proof for the decidability of the binary PCP, proved in 1982 by Ehrenfeucht, Karhumäki and Rozenberg.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196700000376

Reference4 articles.

1. The (generalized) post correspondence problem with lists consisting of two words is decidable

2. Decidability and Undecidability of Marked PCP

3. A variant of a recursively unsolvable problem

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LARGE SIMPLE BINARY EQUALITY WORDS;International Journal of Foundations of Computer Science;2012-09

2. BINARY MORPHISMS WITH STABLE SUFFIX COMPLEXITY;International Journal of Foundations of Computer Science;2011-04

3. REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM;International Journal of Foundations of Computer Science;2011-02

4. The Sequence Equivalence Problem for Marked DT0L Systems;Fundamenta Informaticae;2011

5. More decidable instances of Post's correspondence problem: beyond counting;Information Processing Letters;2008-04