Abstract
The combinatorics of finite, as well as infinite, sequences of symbols (words) over a finite set can be considered at the present time as an independent mathematical topic which has arisen in such diverse fields as logic, algebra, physics, computer science, and, more recently, biology. The theorems and results of this theory are of wide interest and importance for the great number of applications in various fields. A first book, Combinatorics on Words by M. Lothaire [104], collects various basic results of the theory. Since there has been a great development of the theory during these last ten years, a second volume by M. Lothaire [105] called Algebraic Combinatorics on Words, presenting the most recent results of the research on the subject, will appear soon.
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). Combinatorics on Words. 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-59849-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63771-4
Online ISBN: 978-3-642-59849-4
eBook Packages: Springer Book Archive