Skip to main content
SpringerLink
Log in

An Undecidability Result Concerning Periodic Morphisms

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

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

Included in the following conference series:

  • 430 Accesses

Abstract

The following universe problem for the equality sets is shown to be undecidable: given a weak coding h, and two morphisms g 1, g 2, where g 2 is periodic, determine whether or not h(E G(g 1, g 2)) = ∑+, where E G(g 1, g 2) consists of the solutions ω to the equation g 1(ω) = #g 2(ω) for a fixed letter #. The problem is trivially decidable, if instead of E G(g 1, g 2) the equality set E(g 1, g 2) (without a marker symbol #) is chosen.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. B. Baker and R. Book, Reversal-bounded multipushdown machines, J. Comput. System Sci. 8 (1974), 315–332.

    MATH  MathSciNet  Google Scholar 

  2. A. Ehrenfeucht, J. Karhumäki, and G. Rozenberg, The (generalized) Post Correspondence Problem with lists consisting of two words is decidable, Theoret. Comput. Sci. 21 (1982), 119–144.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. A. Greibach, An infinite hierarchy of context-free languages, J. Assoc. Comput. Mach. 16 (1969), 91–106.

    MATH  MathSciNet  Google Scholar 

  4. S.A. Greibach, Remarks on blind and partially blind one-way multicounter machines, Theoret. Comput. Sci. 7 (1978), 311–324.

    Article  MATH  MathSciNet  Google Scholar 

  5. V. Halava and T. Harju, Undecidability in integer weighted finite automata, Fund. Inform. 38 (1999), 189–200.

    MATH  MathSciNet  Google Scholar 

  6. V. Halava, T. Harju, and M. Hirvensalo, Binary (generalized) Post Correspondence Problem, Tech. Report 357, Turku Centre for Computer Science, August 2000, to appear in Theoret. Comput. Sci.

    Google Scholar 

  7. T. Harju and J. Karhumäki, Morphisms, Handbook of Formal Languages (G. Rozenberg and A. Salomaa, eds.), vol. 1, Springer-Verlag, 1997.

    Google Scholar 

  8. T. Harju, J. Karhumäki, and D. Krob, Remarks on generalized Post Correspondence Problem, STACS’96, Lecture Notes in Comput. Sci., vol. 1046, Springer-Verlag, 1996, pp. 39–48.

    Google Scholar 

  9. O. H. Ibarra, Restricted one-counter machines with undecidable universe problems, Math. Systems Theory 13 (1979), 181–186.

    Article  MATH  MathSciNet  Google Scholar 

  10. Y. Matiyasevich and G. Sénizergues, Decision problems for semi-Thue systems with a few rules, Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science (New Brunswick, New Jersey), IEEE Computer Society Press, 27–30 July 1996, pp. 523–531.

    Google Scholar 

  11. E. Post, A variant of a recursively unsolvable problem, Bulletin of Amer. Math. Soc. 52 (1946), 264–268.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and TUCS - Turku Centre for Computer Science, University of Turku, FIN-20014, Turku, Finland

    Vesa Halava & Tero Harju

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

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halava, V., Harju, T. (2002). An Undecidability Result Concerning Periodic Morphisms. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation