Abstract
In this chapter we give some regularity conditions that can be expressed in terms of well quasi-orders. There exist various characterizations of this concept which was often rediscovered by different authors (see [100]); nowadays there exists a large literature on this subject. Well quasi-orders are important in mathematics and in many areas of theoretical computer science as well. Basic theorems such as Higman’s theorem (see Theorem 6.2.1) and Simon’s theorem (see Theorem 6.2.2) give a deep insight into combinatorics on words and language theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
de Luca, A., Varricchio, S. (1999). Well Quasi-orders and Regularity . In: Finiteness and Regularity in Semigroups and Formal Languages. Monographs in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59849-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-59849-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63771-4
Online ISBN: 978-3-642-59849-4
eBook Packages: Springer Book Archive