Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 2001: STACS 2001 pp 388–395Cite as

A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c

  • Conference paper
  • First Online:

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

Abstract

As an evidence of the power of finite unary substitutions we show that the inclusion problem for finite substitutions on the language L = ab * c is undecidable, i.e. it is undecidable whether for two finite substitutions φ and ψ the relation φ(ω) ⊑ (ω) holds for all ω in L.

Research supported under the grant 44087 of the Academy of Finland.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J. Transductions and Context-Free Languages, B.G. Teubner, Stuttgart, 1979.

    Google Scholar 

  2. Conway, J. Regular Algebra and Finite Machines, Chapman and Hall Ltd, London 1971.

    Google Scholar 

  3. Choffrut, C. and Karhumäki, J., Combinatorics of words, in: A. Salomaa and G. Rozenberg (eds), Handbook of Formal Languages, Springer 1997, 324–438.

    Google Scholar 

  4. Culik II, K. and Karhumäki, J., Decision problems solved with the help of Ehrenfeucht Conjecture, EATCS Bulletin 27, 1985, 30–35.

    Google Scholar 

  5. Choffrut, C., Karhumäki, J., and Ollinger, N., The commutation of finite sets: a challenging problem, TUCS Report 303, 1999; Special Issue of Theoret. Comput. Sci on Words, to appear.

    Google Scholar 

  6. Halava, V. and Harju, T., Undecidability of the equivalence of finite substitu-tions on regular languages, Theoret. Inform. and Appl. 33, 1999, 117–124.

    MATH  MathSciNet  Google Scholar 

  7. Karhumäki, J., On the equivalence problem for binary D0L systems, Information and Control 50, 276–284, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  8. Karhumäki, J. and Lisovik, L.P., On the equivalence of finite substitutions and transducers, in: J. Karhumäki, H. Maurer, Gh. Păun and G. Rozenberg (eds), Jewels are Forever, Springer, 1999, 97–108.

    Google Scholar 

  9. Karhumäki, J. and Petre, I., On the centralizer of a finite set, Proceedings of ICALP00, Lecture Notes in Computer Science 1853, Springer, 2000, 536–546.

    Google Scholar 

  10. Lisovik, L. P. An undecidable problem for countable Markov chains, Kibernetika 2, 1991, 1–6.

    MathSciNet  Google Scholar 

  11. Lisovik, L. P. The equivalence problem for finite substitutions on regular lan-guages, Doklady of Academy of Sciences of Russia 357, 1997, 299–301.

    MathSciNet  Google Scholar 

  12. Lisovik, L. P. The equivalence problems for transducers with restricted number of states, Kibernetika i Sistemny Analiz 6, 1997, 109–114.

    MathSciNet  Google Scholar 

  13. Maon, Y., On the equivalence of some transductions involving letter to letter morphisms on regular languages, Acta inform. 23, 1986, 585–596

    Article  MATH  MathSciNet  Google Scholar 

  14. Rozenberg, G. and Salomaa, A., The Mathematical Theory of L Systems, Academic Press, 1980.

    Google Scholar 

  15. Turakainen, P., On some transducer equivalence problems for families of lan-guages, Intern. J. Computer Math. 23, 1988, 99–124.

    Article  MATH  Google Scholar 

  16. Turakainen, P., The Undecidability of some equivalence problems concerning ngsm’s and finite substitutions, Theoret. Comput. Sci. 174, 1997, 269–274.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Juhani Karhumäki

  2. Department of Cybernetics, Kiev National University, 252017, Kiev, Ukraine

    Leonid P. Lisovik

Authors
  1. Juhani Karhumäki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leonid P. Lisovik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. I3S & INRIA Sophia Antipolis INRIA, CNRS, 2004 Route des Lucioles, 06902, Sophia-Antipolis, France

    Afonso Ferreira

  2. Institut für Theoretische Informatik, Fakultät Informatik, TU Dresden, 01062, Dresden, Germany

    Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karhumäki, J., Lisovik, L.P. (2001). A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-44693-1_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41695-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation