Binary (generalized) Post Correspondence Problem

Page 1

	Year	Citations
Transductions and Context-Free Languages Jean Berstel SyntaxGrammatical FormalismComputational LinguisticsGrammarContext-free Languages	1979	1.3K
A variant of a recursively unsolvable problem Emil L. Post Bulletin of the American Mathematical Society Mathematical ProgrammingComputational Complexity TheoryEngineeringUnsolvable ProblemComputational Complexity	1946	608
The (generalized) post correspondence problem with lists consisting of two words is decidable Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg Theoretical Computer Science Combinatorics On WordEngineeringAutomated ReasoningComputational LinguisticsCombinatorial Pattern Matching	1982	83
Decision problems for semi-Thue systems with a few rules Yuri Matiyasevich, Géraud Sénizergues Mathematical ProgrammingEngineeringReachability ProblemComputational ComplexityFormal Verification	2002	60
Marked PCP is decidable Vesa Halava, Mika Hirvensalo, Ronald de Wolf Theoretical Computer Science	2001	19
GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS Vesa Halava, Tero Harju, Mika Hirvensalo International Journal of Algebra and Computation Mathematical ProgrammingComputational LogicEngineeringAutomated ReasoningBinary Pcp	2000	13

Page 1