Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2008: Developments in Language Theory pp 84–95Cite as

Well Quasi-orders in Formal Language Theory

  • Conference paper

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

Abstract

The concept of well quasi-order is a generalization of the classical notion of well order and plays a role in the studying of several problems of Mathematics and Theoretical Computer Science. This paper concerns some applications of well quasi-orders to Formal Language Theory. In particular, we present a survey of classical and recent results, based upon such structures, concerning context-free and regular languages. We also focus our attention to some application of well quasi-orders in the studying of languages obtained by using the operators of shuffle and iterated shuffle of finite languages.

The first author acknowledges the partial support of “fundings “Facoltà di Scienze MM. FF. NN. 2006” of the University of Rome “La Sapienza”.

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. Bovet, D.P., Varricchio, S.: On the regularity of languages on a binary alphabet generated by copying systems. Information Processing Letters 44, 119–123 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. D’Alessandro, F., Varricchio, S.: On well quasi-orders on languages. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 230–241. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. D’Alessandro, F., Varricchio, S.: Well quasi-orders and context-free grammars. Theoretical Computer Science 327(3), 255–268 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. D’Alessandro, F., Varricchio, S.: Avoidable sets and well quasi orders. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 139–150. Springer, Heidelberg (2004)

    Google Scholar 

  5. D’Alessandro, F., Varricchio, S.: Well quasi-orders, unavoidable sets, and derivation systems. RAIRO Theoretical Informatics and Applications 40, 407–426 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. D’Alessandro, F., Richomme, G., Varricchio, S.: Well quasi orders and the shuffle closure of finite sets. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 260–269. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. D’Alessandro, F., Richomme, G., Varricchio, S.: Well quasi-orders and context-free grammars. Theoretical Computer Science 377(1–3), 73–92 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. de Luca, A., Varricchio, S.: Some regularity conditions based on well quasi-orders. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 356–371. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  9. de Luca, A., Varricchio, S.: Well quasi-orders and regular languages. Acta Informatica 31, 539–557 (1994)

    Article  MathSciNet  Google Scholar 

  10. de Luca, A., Varricchio, S.: Finiteness and regularity in semigroups and formal languages. EATCS Monographs on Theoretical Computer Science. Springer, Berlin (1999)

    MATH  Google Scholar 

  11. Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoretical Computer Science 27, 311–332 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  12. Harju, T., Ilie, L.: On well quasi orders of words and the confluence property. Theoretical Computer Science 200, 205–224 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Haussler, D.: Another generalization of Higman’s well quasi-order result on Σ *. Discrete Mathematics 57, 237–243 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ehrenfeucht, A., Rozenberg, G.: On regularity of languages generated by copying systems. Discrete Applied Mathematics 8, 313–317 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  15. Higman, G.H.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 3, 326–336 (1952)

    Article  MathSciNet  Google Scholar 

  16. Ilie, L., Salomaa, A.: On well quasi orders of free monoids. Theoretical Computer Science 204, 131–152 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  17. Intrigila, B., Varricchio, S.: On the generalization of Higman and Kruskal’s theorems to regular languages and rational trees. Acta Informatica 36, 817–835 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ito, M., Kari, L., Thierrin, G.: Shuffle and scattered deletion closure of languages. Theoretical Computer Science 245(1), 115–133 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Jantzen, M.: Extending regular expressions with iterated shuffle. Theoretical Computer Science 38, 223–247 (1985)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. Kunc, M.: The power of commuting with finite sets of words. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 569–580. Springer, Heidelberg (2005)

    Google Scholar 

  22. Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theoretical Computer Science 348(2-3), 277–293 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  23. Lothaire: Algebraic combinatorics on words. In: Encyclopedia of Mathematics and its applications. Cambridge University Press, Cambridge (2002)

    Google Scholar 

  24. Puel, L.: Using unavoidable sets of trees to generalize Kruskal’s theorem. J. Symbolic Comput. 8(4), 335–382 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  25. Sakarovitch, J.: Éléments de théorie des automates, Vuibert, Paris (2003)

    Google Scholar 

  26. Senizergues, G.: On the rational subsets of the free group. Acta Informatica 33(3), 281–296 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Università di Roma “La Sapienza”, Piazzale Aldo Moro 2, 00185, Roma, Italy

    Flavio D’Alessandro

  2. Dipartimento di Matematica, Università di Roma “Tor Vergata”, via della Ricerca Scientifica, 00133, Roma, Italy

    Stefano Varricchio

Authors
  1. Flavio D’Alessandro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Varricchio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Masami Ito Masafumi Toyama

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

D’Alessandro, F., Varricchio, S. (2008). Well Quasi-orders in Formal Language Theory. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85780-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85780-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85779-2

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation