Skip to main content
SpringerLink
Log in

On simplest possible solutions for Post Correspondence Problems

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

We investigate the simplicity of solutions for instances of the Post Correspondence Problem, from the point of view of both index words and terminal words. This leads to the notion of amixed primality type of an instance. Our main result gives an exhaustive characterization of mixed primality types.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Culik, K.: A purely homomorphic characterization of recursively enumerable languages. J. Assoc. Comput. Mach.26, 345–350 (1979)

    Google Scholar 

  2. Mateescu, A., Salomaa, A.: PCP-prime words and primality types. RAIRO/Theor. Comput. Sci. (to appear)

  3. Post, E.: A variant of a recursively unsolvable problem. Bull. Am. Math. Soc.52, 264–268 (1946)

    Google Scholar 

  4. Salomaa, A.: Jewels of formal language theory. Oxford: Computer Science Press 1981

    Google Scholar 

  5. Salomaa, A., Salomaa, K., Yu, Sheng: Primality types of instances of the Post Correspondence Problem. EATCS Bull.44, 226–241 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Bucharest, Academiei 14, Sector 1, R-70109, Bucharest, Romania

    Alexandru Mateescu

  2. Academy of Finland and Mathematics Department, University of Turku, SF-20500, Turku, Finland

    Arto Salomaa

Authors
  1. Alexandru Mateescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mateescu, A., Salomaa, A. On simplest possible solutions for Post Correspondence Problems. Acta Informatica 30, 441–457 (1993). https://doi.org/10.1007/BF01210595

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01210595

Keywords

Search

Navigation