Skip to main content

Well Quasi Orders and the Shuffle Closure of Finite Sets

  • Conference paper
Developments in Language Theory (DLT 2006)

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

Included in the following conference series:

Abstract

Given a set I of words, the set L\(_{\rm \vdash}^{\epsilon}~_{\rm I}\) of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order: for u, v in L\(_{\rm \vdash}^{\epsilon}~_{\rm I}\), u \(\vdash^{\rm *}_{I}\) v if and only if v is the shuffle of u and another word of L\(_{\rm \vdash}^{\epsilon}~_{\rm I}\). In [3], the authors have stated the problem of the characterization of the finite sets I such that \(\vdash_{I}^{\rm *}\) is a well quasi-order on L\(_{\rm \vdash}^{\epsilon}~_{\rm I}\). In this paper we give the answer in the case when I consists of a single word w.

This work was partially supported by MIUR project “Linguaggi formali e automi: teoria e applicazioni”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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. 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 

  2. 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 

  3. D’Alessandro, F., Varricchio, S.: Well quasi-orders, unavoidable sets, and derivation systems. RAIRO Theoretical Informatics and Applications (to appear)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. 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 

  12. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. 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 

  15. Lothaire: Combinatorics on words. Series Encyclopedia of Mathematics and its Applications, vol. 17. Addison-Wesley, Reading, Mass. (1983)

    Google Scholar 

  16. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

D’Alessandro, F., Richomme, G., Varricchio, S. (2006). Well Quasi Orders and the Shuffle Closure of Finite Sets. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_24

Download citation

  • DOI: https://doi.org/10.1007/11779148_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35428-4

  • Online ISBN: 978-3-540-35430-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics