Information and Computation
On the decidability of some problems about rational subsets of free partially commutative monoids
Theoretical Computer Science
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
The Book of Traces
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Binary (generalized) post correspondence problem
Theoretical Computer Science
Remarks on Generalized Post Correspondence Problem
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A useful device for showing the solvability of some decision problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We introduce a version of Post Correspondence Problem (PCP, in short) generalized to words over partially commutative alphabets. Several observations are presented about the algorithmic status of the introduced problem. In particular solvability is shown for the partially commutative PCP for two special cases: the binary case of PCP (denoted by PCP(2) ), and the case with one periodic morphism. This extends solvability results for the classical PCP for these cases. Also a weaker version of PCP, named here Weak-PCP, is discussed. This version distinguishes (in the sense of solvability) the case of noncommutative from the case of partially commutative alphabets. We consider also a solvable (though NP-hard) simple version of Weak-PCP. Our solvability results demonstrate the power of Ibarra's algorithms for reversal bounded multi-counter machines.