Post Correspondence Problem and Small Dimensional Matrices

Authors:
Tero Harju
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland 20014
Venue:
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Year:
2009

Citing 0
Cited 2

The Identity Correspondence Problem and Its Applications

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the Computational Complexity of Matrix Semigroup Problems

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Quantified Score

Hi-index	0.00

Visualization

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).