Marked PCP is decidable

Theoretical Computer Science

Volumn 255, Issue 1-2, 2001, Pages 193-204

  Halava, Vesa ^a   Hirvensalo, Mika ^a,b   De Wolf, Ronald ^c,d  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b UNIVERSITY OF TURKU   (Finland)

^c CWI   (Netherlands)

^d UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Decidability; Marked morphism; Post Correspondence Problem

Indexed keywords

MATHEMATICAL MORPHOLOGY; PROBLEM SOLVING; THEOREM PROVING;

MARKED MORPHISM; POST CORRESPONDENCE PROBLEM (PCP);

COMPUTABILITY AND DECIDABILITY;

EID: 0034911149     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00163-2     Document Type: Article

References (10)

1. The (generalized) Post correspondence problem with lists consisting of two words is decidable
2. Remarks on generalized Post correspondence problem
3. Morphisms
4. Récursive insolubilité de l'équation générale de diagonalisation de deux monomorphisms de monoïdes libres φx=Ψx
5. Decision problems for semi-Thue systems with a few rules
6. A variant of a recursively unsolvable problem
7. Reversible machines and Post's correspondence problem for biprefix morphisms
8. Associative calculus with an unsolvable equivalence problem