Abstract
This chapter deals with some properties, known as unavoidable regularities, which are always satisfied by sufficiently long words over a finite alphabet. The study of these regularities, as we shall see in the following sections and chapters, is of great interest in combinatorics on words both for the importance of the subject itself and for the applications in many areas of algebra and theoretical computer science.
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). Unavoidable Regularities. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-59849-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63771-4
Online ISBN: 978-3-642-59849-4
eBook Packages: Springer Book Archive