Skip to main content
SpringerLink
Log in

On Language Inequalities XK ⊆ LX

  • Conference paper
Developments in Language Theory (DLT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3572))

Included in the following conference series:

Abstract

It is known that for a regular language L and an arbitrary language K the largest solution of the inequality XK ⊆ LX is regular. Here we show that there exist finite languages K and P and star-free languages L, M and R such that the largest solutions of the systems \(\{XK\subseteq LX,\ X\subseteq M\}\) and \(\{XK\subseteq LX,\ XP\subseteq RX\}\) are not recursively enumerable.

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. Aiken, A., Kozen, D., Vardi, M., Wimmers, E.: The complexity of set constraints. In: Meinke, K., Börger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol. 832, pp. 1–17. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  2. Baader, F., Küsters, R.: Unification in a description logic with transitive closure of roles. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 217–232. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Charatonik, W., Podelski, A.: Co-definite set constraints. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 211–225. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Choffrut, C., Karhumäki, J., Ollinger, N.: The commutation of finite sets: A challenging problem. Theoret. Comput. Sci. 273, 69–79 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)

    MATH  Google Scholar 

  6. Karhumäki, J., Latteux, M., Petre, I.: Commutation with codes. Theoret. Comput. Sci. (to appear)

    Google Scholar 

  7. Karhumäki, J., Latteux, M., Petre, I.: Commutation with ternary sets of words. Theory Comput. Syst. 38(2), 161–169 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Karhumäki, J., Petre, I.: Two problems on commutation of languages. In: Current Trends in Theoretical Computer Science. The Challenge of the New Century, vol. 2, pp. 477–493. World Scientific, Singapore (2004)

    Chapter  Google Scholar 

  9. Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theoret. Comput. Sci. (to appear); Extended abstract in Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.): ICALP 2004. LNCS, vol. 3142, pp. 870–881. Springer, Heidelberg (2004)

    Google Scholar 

  10. Kunc, M.: Simple language equations. Bull. EATCS 85, 81–102 (2005)

    MATH  MathSciNet  Google Scholar 

  11. Kunc, M.: The power of commuting with finite sets of words (2004) (manuscript), available at http://www.math.muni.cz/~kunc/ ; Extended abstract in Diekert, V., Durand, B. (eds.): STACS 2005. LNCS, vol. 3404. Springer, Heidelberg (2005)

  12. Kunc, M.: Largest solutions of left-linear language inequalities(2005) (manuscript), available at http://www.math.muni.cz/~kunc/

  13. Leiss, E.L.: Language Equations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  14. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  15. Okhotin, A.: Decision problems for language equations(Submitted for publication), available at http://www.cs.queensu.ca/home/okhotin/ ; Preliminary version in Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.): ICALP 2003. LNCS, vol. 2719, pp. 239–251. Springer, Heidelberg (2003)

  16. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)

    MATH  MathSciNet  Google Scholar 

  17. Ratoandromanana, B.: Codes et motifs. RAIRO Inform. Théor. Appl. 23(4), 425–444 (1989)

    MATH  MathSciNet  Google Scholar 

  18. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Michal Kunc

  2. Turku Centre for Computer Science, FIN-20014, Turku, Finland

    Michal Kunc

Authors
  1. Michal Kunc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Applicazioni, Università di Salerno, via Ponte Don Melillo, 84084, Fisciano, SA, Italy

    Clelia De Felice

  2. Dipartimento di Matematica ed Applicazioni, Università di Palermo, Via Archirafi, 34, 90123, Palermo, Italy

    Antonio Restivo

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kunc, M. (2005). On Language Inequalities XK ⊆ LX . In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_29

Download citation

  • DOI: https://doi.org/10.1007/11505877_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26546-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation