Abstract
This is a survey on some undecidable problems on integer matrices. The proofs of these results employ special instances, called Claus instances, of the Post Correspondence Problem. The presentation is based on the article Halava et al. “Undecidability bounds for integer matrices using Claus instances” (Internat. J. Foundations of Comput. Sci. 18, 2007, 931–948).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bell, P., Halava, V., Harju, T., Karhumäki, J., Potapov, I.: Matrix equations and Hilbert’s tenth problem. Internat. J. Algebra and Computation 18, 1–11 (2008)
Bell, P., Potapov, I.: On the membership of invertible diagonal matrices. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 146–157. Springer, Heidelberg (2005)
Bell, P., Potapov, I.: On undecidability bounds for matrix decision problems. Theoret. Comput. Sci. 391, 3–13 (2008)
Blondel, V.D., Tsitsiklis, J.N.: When is a pair of matrices mortal? Information Processing Lett. 63, 283–286 (1997)
Cassaigne, J., Harju, T., Karhumäki, J.: On the undecidability of freeness of matrix semigroups, Internat. J. Algebra Comput. 9, 295–305 (1999)
Cassaigne, J., Karhumäki, J.: Examples of undecidable problems for 2-generator matrix semigroups. Theoret. Comput. Sci. 204, 29–34 (1998)
Ceitin, G.C.: Associative calculus with an unsolvable equivalence problem. Tr. Mat. Inst. Akad. Nauk 52, 172–189 (1958) (in Russian)
Claus, V.: Some remarks on PCP(k) and related problems. Bull. of the EATCS 12, 54–61 (1980)
Ehrenfeucht, A., Karhumäki, J., Rozenberg, G.: The (generalized) Post Correspondence Problem with lists consisting of two words is decidable. Theoret. Comput. Sci. 21, 119–144 (1982)
Halava, V., Harju, T.: On Markov’s undecidability theorem for integer matrices. Semigroup Forum 75, 173–180 (2007)
Halava, V., Harju, T., Hirvensalo, M.: Undecidability bounds for integer matrices using Claus instances. Internat. J. Foundations of Comput. Sci. 18, 931–948 (2007)
Halava, V., Harju, T., Hirvensalo, M., Karhumäki, J.: Post Correspondence Problem for short words. Inform. Process. Lett. 108, 115–118 (2008)
Harju, T., Karhumäki, J.: Morphisms. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 439–510. Springer, Heidelberg (1997)
Klarner, D.A., Birget, J.-C., Satterfield, W.: On the undecidability of the freeness of integer matrix semigroups. Internat. J. Algebra Comp. 1, 223–226 (1991)
Matiyasevich, Y., Sénizergues, G.: Decision problems for semi-Thue systems with a few rules. Theoret. Comput. Sci. 330, 145–169 (2005)
Paterson, M.S.: Unsolvability in 3×3 matrices. Stud. Appl. Math. 49, 105–107 (1970)
Pavlenko, V.A.: Post combinatorial problem with two pairs of words. Dokl. Akad. Nauk. Ukr. SSR, 9–11 (1981)
Post, E.: A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc. 52, 264–268 (1946)
Schultz, P.: Mortality of 2×2 matrices. Amer. Math. Monthly 84, 463–464 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harju, T. (2009). Post Correspondence Problem and Small Dimensional Matrices. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)