Binary (generalized) Post Correspondence Problem

Transductions and Context-Free Languages

Jean Berstel · 1979 · 1.3K citations

Syntax, Grammatical Formalism, Computational Linguistics +7

A variant of a recursively unsolvable problem

Emil L. Post · Bulletin of the American Mathematical Society · 1946 · 608 citations · Full text

Mathematical Programming, Computational Complexity Theory, Engineering +6

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

Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg · Theoretical Computer Science · 1982 · 83 citations

Combinatorics On Word, Engineering, Automated Reasoning +10

Decision problems for semi-Thue systems with a few rules

Yuri Matiyasevich, Géraud Sénizergues · 2002 · 60 citations

Mathematical Programming, Engineering, Reachability Problem +17

Marked PCP is decidable

Vesa Halava, Mika Hirvensalo, Ronald de Wolf · Theoretical Computer Science · 2001 · 19 citations