Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Clerbout, M., Latteux, M.: Semi-commutations. Information & Computation 73(1), 59–74 (1987)
Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific Publishing Co., Inc., Singapore (1995)
Ehrenfeucht, A., Karhumäki, J., Rozenberg, G.: The (generalized) Post correspondence problem with lists consisting of two words is decidable. Theor. Comput. Sci. 21, 119–144 (1982)
Ehrenfeucht, A., Karhumäki, J., Rozenberg, G.: On binary equality sets and a solution to the set conjecture in the binary case. Journal of Algebra 85, 76–85 (1983)
Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae 31, 13–26 (1997)
Gibbons, A., Rytter, W.: On the decidability of some problems about rational subsets of free partially commutative monoids. Theor. Comput. Sci. 48(2-3), 329–337 (1986)
Halava, V., Harju, T., Hirvensalo, M.: Binary (generalized) Post correspondence problem. Theor. Comput. Sci. 276(1-2), 183–204 (2002)
Harju, T., Karhumäki, J.: Morphisms. In: Handbook of formal languages, vol. 1 (1997)
Harju, T., Karhumäki, J., Krob, D.: Remarks on generelized Post correspondence problem. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 39–48. Springer, Heidelberg (1996)
Holub, S.: Binary equality sets are generated by two words. Int. J. Algebra (259), 1–42 (2003)
Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (2001)
Ibarra, O.H., Kim, C.E.: A useful device for showing the solvability of some decision problems. In: STOC ’76: Proceedings of the eighth annual ACM symposium on Theory of computing, pp. 135–140 (1976)
Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. J. ACM 25(1), 116–133 (1978)
Kopczyǹski, E.: Personal Communication (2009)
Kopczyński, E.: Complexity of problems of commutative grammars, draft (2009)
Lasota, S.: Personal Communication (2009)
Leroux, J.: A polynomial time Presburger criterion and synthesis for number decision diagrams. In: LICS, pp. 147–156 (2005)
Leroux, J.: Personal Communication (2009)
Matiyasevich, Y., Sénizergues, G.: Decision problems for semi-Thue systems with a few rules, pp. 523–531 (1996)
Mazurkiewicz, A.: Concurrent program schemes and their interpretations. Technical report, Aarhus University (1977)
Ochmański, E.: Recognizable Trace Languages, pp. 167–204. World Scientific Publishing Co., Inc., Singapore (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klunder, B., Rytter, W. (2010). Post Correspondence Problem with Partially Commutative Alphabets. In: Dediu, AH., Fernau, H., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2010. Lecture Notes in Computer Science, vol 6031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13089-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-13089-2_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13088-5
Online ISBN: 978-3-642-13089-2
eBook Packages: Computer ScienceComputer Science (R0)