Skip to main content

Some regularity conditions based on well quasi-orders

  • Conference paper
  • First Online:
LATIN '92 (LATIN 1992)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, “Transductions and Context-Free Languages”, Teubner, Stuttgart, 1979.

    Google Scholar 

  2. A. de Luca and S. Varricchio, Finiteness and iteration conditions for semigroups, Theoretical Computer Science, 87 (1991) 315–327.

    Google Scholar 

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

    Google Scholar 

  4. S. Eilenberg, “Automata, Languages and Machines”, vol. A, Academic Press, New York, 1974.

    Google Scholar 

  5. D. Haussler, Another generalization of Higman's well quasi order result on ∑*, Discrete Mathematics, 57 (1985) 237–243.

    Google Scholar 

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

    Google Scholar 

  7. J. Justin and G. Pirillo, A finiteness condition for semigroups generated by a finite set of elements of finite order, PU.M.A. (Ser. A), 1 (1990) 45–48.

    Google Scholar 

  8. J. Kruskal, The theory of Well-Quasi-ordering: A Frequently Discovered Concept, J. Combin. Theory (Ser. A) 13 (1972) 297–305.

    Google Scholar 

  9. M. Latteux and G. Rozenberg, Commutative one-counter Languages are regular, J. Comput. and System Sci. 29 (1984) 54–57.

    Google Scholar 

  10. M. Lanzillotta, Le proprietà d'iterazione nella teoria dei linguaggi formali, Tesi, Università di Roma “La Sapienza”, 1990.

    Google Scholar 

  11. M. Lothaire, “Combinatorics on words”, Addison Wesley, Reading Mass. 1983.

    Google Scholar 

  12. F. Migliorini and J. Szép, On finitely generated semigroups with permutation property, PU.M.A. ser.A, 1 (1990) 33–37.

    Google Scholar 

  13. P. Perkins, Bases for equational theories of semigroups, J. of Algebra, 11(1968) 298–314.

    Google Scholar 

  14. A. Restivo and C. Reutenauer, Some applications of a theorem of Shirshov to Language theory, Information and Control, 57 (1983) 205–213.

    Google Scholar 

  15. A. Restivo and C. Reutenauer, On the Burnside Problem for semigroups, J. of Algebra, 89 (1984), 102–104.

    Google Scholar 

  16. A. Restivo and C. Reutenauer, Rational Languages and the Burnside problem, Theoretical Computer Science 40 (1983) 13–30.

    Google Scholar 

  17. I. Simon, Piecewise testable events, in Lecture Notes in Computer Science, vol.33, Springer Verlag, New York, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Imre Simon

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Luca, A., Varricchio, S. (1992). Some regularity conditions based on well quasi-orders. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023841

Download citation

  • DOI: https://doi.org/10.1007/BFb0023841

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55284-0

  • Online ISBN: 978-3-540-47012-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics