Binary (generalized) post correspondence problem

Theoretical Computer Science

Volumn 276, Issue 1-2, 2002, Pages 183-204

  Halava, Vesa ^a,b   Harju, Tero ^a   Hirvensalo, Mika ^a,b  

^a UNIVERSITY OF TURKU   (Finland)

^b TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

Binary Post Correspondence Problem; Decidability; Generalised Post Correspondence Problem; Marked Morphisms; Post Correspondence Problem

Indexed keywords

COMPUTER SCIENCE; DECISION THEORY; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

BINARY PROBLEMS;

THEOREM PROVING;

EID: 0037029338     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00157-8     Document Type: Article

References (9)

1. The (generalized) Post correspondence problem with lists consisting of two words is decidable
2. Generalized post correspondence problem for marked morphisms
3. Marked PCP is decidable
4. Morphisms
5. Remarks on generalized post correspondence problem
6. Decision problems for semi-Thue systems with a few rules
7. A variant of a recursively unsolvable problem