More decidable instances of Post's correspondence problem: beyond counting

Authors:
Mirko Rahn
Affiliations:
Universität Karlsruhe (TH), IAKS Vollmar, D-76128 Karlsruhe, Germany
Venue:
Information Processing Letters
Year:
2008

Citing 5
Cited 0

Morphisms

Handbook of formal languages, vol. 1
Marked PCP is decidable

Theoretical Computer Science
Extension of the decidability of the marked PCP to instances with unique blocks

Theoretical Computer Science
A Remark on Code Sets and Context-Free Languages

IEEE Transactions on Computers
A useful device for showing the solvability of some decision problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a new technique to decide or reduce instances of Post's correspondence problem. It generalizes balance arguments to a consideration about some special context-free languages which allow the combination with other decision (or reduction) techniques. In spite of its simplicity, the new technique is able to decide more instances than known techniques.