Skip to main content
SpringerLink
Log in

Regular Solutions of Language Inequalities and Well Quasi-orders

  • Conference paper
Automata, Languages and Programming (ICALP 2004)

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

Included in the following conference series:

Abstract

By means of constructing suitable well quasi-orders of free monoids we prove that all maximal solutions of certain systems of language inequalities are regular. This way we deal with a wide class of systems of inequalities where all constants are languages recognized by finite simple semigroups. In a similar manner we also demonstrate that the largest solution of the inequality XK ⊆ LX is regular provided the language L is regular.

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
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. 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 

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

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  4. Ehrenfeucht, A., Haussler, D., Rosenberg, G.: On regularity of context-free languages. Theor. Comput. Sci. 27, 311–332 (1983)

    Article  MATH  Google Scholar 

  5. Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 2, 326–336 (1952)

    Article  MATH  MathSciNet  Google Scholar 

  6. Howie, J.M.: Fundamentals of Semigroup Theory. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  7. Karhumäki, J., Petre, I.: Conway’s problem for three-word sets. Theor. Comput. Sci. 289, 705–725 (2002)

    Article  MATH  Google Scholar 

  8. Karhumäki, J., Petre, I.: Two problems on commutation of languages. In: Current Trends in Theoretical Computer Science, World Scientific, Singapore (to appear)

    Google Scholar 

  9. Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi’s conjecture. Trans. Amer. Math. Soc. 95, 210–225 (1960)

    MATH  MathSciNet  Google Scholar 

  10. Kruskal, J.B.: The theory of well-quasi-ordering: a frequently discovered concept. J. Comb. Theory, Ser. A 13, 297–305 (1972)

    Article  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

  12. Kunc, M.: Regular solutions of language inequalities and well quasi-orders (2004) (manuscript), available at http://www.math.muni.cz/~kunc

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

    MATH  Google Scholar 

  14. Okhotin, A.: Decision problems for language equations (2003) (submitted)

    Google Scholar 

  15. Okhotin, A.: Greatest solutions of language equations (2003) (submitted)

    Google Scholar 

  16. 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, Masaryk University, Janáčkovo nám. 2a, 662 95, Brno, Czech Republic

    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. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, 240 Jordi Girona Salgado, 1-3 E-08034, Barcelona

    Josep Díaz

  2. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. Department of Mathematics, University of Turku, Turku, Finland

    Arto Lepistö

  4. Laboratory for Foundations of Computer Science, University of Edinburgh,  

    Donald Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kunc, M. (2004). Regular Solutions of Language Inequalities and Well Quasi-orders. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_73

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27836-8_73

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-27836-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation