Skip to main content
Springer Nature Link
Log in

Decidability and Undecidability of Marked PCP

  • Conference paper
  • First Online:
STACS 99 (STACS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1563))

Included in the following conference series:

  • 1685 Accesses

Abstract

We show that the marked version of the Post Correspondence Problem, where the words on a list are required to differ in the first letter, is decidable. On the other hand, PCP remains undecidable if we only require the words to differ in the first two letters. Thus we locate the decidability/undecidability-boundary between marked and 2-marked PCP.

Supported by the Academy of Finland under grant 14047.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. Ehrenfeucht, J. Karhumäki, and G. Rozenberg. The (generalized) Post correspondence problem with lists consisting of two words is decidable. Theoretical Computer Science, 21(2):119–144, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.

    Google Scholar 

  3. T. Harju, J. Karhumäki, and D. Krob. Remarks on generalized Post correspondence problem. In Proceedings of 13th STACS, volume 1046 of Lecture Notes in Computer Science, pages 39–48. Springer-Verlag, 1996.

    Google Scholar 

  4. Y. Lecerf. Récursive insolubilité de l’équation générale de diagonalisation de deux monomorphisms de monoïdes libres φx = Ψx. Comptes Rendus Acad. Sci. Paris, 257:2940–2943, 1963.

    MATH  MathSciNet  Google Scholar 

  5. Y. Matiyasevich and G. Sénizergues. Decision problems for semi-Thue systems with a few rules. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science, pages 523–531, 1996.

    Google Scholar 

  6. E. L. Post. A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52:264–268, 1946.

    Article  MATH  MathSciNet  Google Scholar 

  7. G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages, volume 1. Springer-Verlag, Berlin, 1997.

    MATH  Google Scholar 

  8. K. Ruohonen. Reversible machines and Post’s correspondence problem for biprefix morphisms. Journal of Information Processing and Cybernetics (EIK), 21(12):579–595, 1985.

    MATH  MathSciNet  Google Scholar 

  9. A. Salomaa. Jewels of Formal Language Theory. Pitman, 1981.

    Google Scholar 

  10. G. C. Tzeitin. Associative calculus with an unsolvable equivalence problem. Tr. Mat. Inst. Akad. Nauk, 52:172–189, 1958. In Russian.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Turku Centre for Computer Science, Lemminkäisenkatu 14 A, 4th floor, FIN-20520, Turku, Finland

    Vesa Halava & Mika Hirvensalo

  2. Department of Mathematics, University of Turku, FIN-20014, Turku, Finland

    Mika Hirvensalo

  3. CWI, P.O. BOX 94079, Amsterdam, The Netherlands

    Ronald de Wolf

  4. University of Amsterdam, The Netherlands

    Ronald de Wolf

Authors
  1. Vesa Halava
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mika Hirvensalo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ronald de Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. FB IV - Informatik, Universität Trier, D-54286, Trier, Germany

    Christoph Meinel

  2. LIFL, Université de Lille I, Bătiment 3, F-59655, Villeneuve d’Ascq Cedex, France

    Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halava, V., Hirvensalo, M., de Wolf, R. (1999). Decidability and Undecidability of Marked PCP. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-49116-3_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65691-3

  • Online ISBN: 978-3-540-49116-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation