Skip to main content
SpringerLink
Log in

Generalized PCP is decidable for marked morphisms

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1999)

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

Included in the following conference series:

  • 386 Accesses

Abstract

We prove that the generalized Post Correspondence Problem (GPCP) is decidable for marked morphisms. This result gives as a corollary a shorter proof for the decidability of the binary PCP, proved in 1982 by Ehrenfeucht, Karhumäki and Rozenberg.

Article

For more detailed proofs, see full paper: http://www.tucs.abo.fi/publications/techreports/TR283.html

Article

Supported by the Academy of Finland under grant 44087.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

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. V. Halava, M. Hirvensalo and R. de Wolf. Decidability and Undecidability of Marked PCP. STACS’99 (C. Meinel and S. Tison, eds.), Lecture Notes in Comput. Sci, vol 1563, Springer-Verlag, 1999, pp. 207–216.

    Google Scholar 

  3. T. Harju and J. Karhumäki. Morphisms. In Handbook of Formal Languages, volume 1, 439–510. edited by G. Rozenberg and A. Salomaa, eds. Springer-Verlag, Berlin, 1997.

    Google Scholar 

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

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

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

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

    Tero Harju

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

    Mika Hirvensalo

  4. Turku Centre for Computer Science, Finland

    Mika Hirvensalo

Authors
  1. Vesa Halava
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tero Harju
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mika Hirvensalo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, “A.I.Cuza” University, 6600, Iaşi, Romania

    Gabriel Ciobanu

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halava, V., Harju, T., Hirvensalo, M. (1999). Generalized PCP is decidable for marked morphisms. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-48321-7_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48321-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation