Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
Hostname: page-component-684899dbb8-mhx7p Total loading time: 0.256 Render date: 2022-05-26T12:34:56.169Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true }
  • English
RAIRO - Theoretical Informatics and Applications RAIRO - Theoretical Informatics and Applications

Article contents

Undecidability of infinite post correspondence problem for instances of Size 9

Published online by Cambridge University Press:  08 November 2006

Vesa Halava  and
Tero Harju
Vesa Halava
Affiliation:
Department of Mathematics and TUCS – Turku Centre for Computer Science, University of Turku, 20014 Turku, Finland; vesa.halava@utu.fi; harju@utu.fi
Tero Harju
Affiliation:
Department of Mathematics and TUCS – Turku Centre for Computer Science, University of Turku, 20014 Turku, Finland; vesa.halava@utu.fi; harju@utu.fi
Get access

Abstract

In the infinite Post Correspondence Problem an instance (h,g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by Ruohonen (1985) in general. Recently Blondel and Canterini (Theory Comput. Syst.36 (2003) 231–245) showed that this problem is undecidable for domain alphabets of size 105. Here we give a proof that the infinite Post Correspondence Problem is undecidable for instances where the morphisms have domains of 9 letters. The proof uses a recent result of Matiyasevich and Sénizergues and a modification of a result of Claus.

Keywords

Infinite Post Correspondence Problemundecidabilityword problemsemi–Thue system.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 40 , Issue 4 , October 2006 , pp. 551 - 557
Copyright
© EDP Sciences, 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Blondel, V.D. and Canterini, V., Undecidable problems for probabilistic automata of fixed dimension. Theory Comput. Syst. 36 (2003) 231–245. CrossRef
Claus, V., Some remarks on PCP(k) and related problems. Bull. EATCS 12 (1980) 54–61.
Ehrenfeucht, A., Karhumäki, J. and Rozenberg, G., The (generalized) Post Correspondence Problem with lists consisting of two words is decidable. Theoret. Comput. Sci. 21 (1982) 119–144. CrossRef
Halava, V. and Harju, T., Infinite solutions of the marked Post Correspondence Problem, in Formal and Natural Computing, edited by J. Karhumäki, W. Brauer, H. Ehrig and A. Salomaa. Lecture Notes in Comput. Sci. 2300 (2002) 57–68. CrossRef
Halava, V., Harju, T. and Hirvensalo, M., Binary (generalized) Post Correspondence Problem. Theoret. Comput. Sci. 276 (2002) 183–204. CrossRef
Halava, V., Harju, T. and Karhumäki, J., Decidability of the binary infinite Post Correspondence Problem. Discrete Appl. Math. 130 (2003) 521–526. CrossRef
T. Harju and J. Karhumäki, Morphisms, in Handbook of Formal Languages, volume 1, edited by G. Rozenberg and A. Salomaa, Springer-Verlag (1997) 439–510.
Harju, T., Karhumäki, J. and Krob, D., Remarks on generalized Post correspondence problem, in STACS'96, edited by C. Puech and R. Reischuk. Lect. Notes Comput. Sci. 1046 (1996) 39–48.
Matiyasevich, Y. and Sénizergues, G., Decision problems for semi–Thue systems with a few rules. Theor. Comput. Sci. 330 (2005) 145–169. CrossRef
Post, E., A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc. 52 (1946) 264–268. CrossRef
K. Ruohonen, Reversible machines and Post's correspondence problem for biprefix morphisms. J. Inform. Process. Cybernet. EIK 21 (1985) 579–595.

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Undecidability of infinite post correspondence problem for instances of Size 9
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Undecidability of infinite post correspondence problem for instances of Size 9
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Undecidability of infinite post correspondence problem for instances of Size 9
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *