Beschreibung:
Comprehensive 2002 introduction to combinatorics on words for mathematicians and theoretical computer scientists.
1. Finite and infinite words J. Berstel and D. Perrin; 2. Sturmian words J. Berstel and P. Séébold; 3. Unavoidable patterns J. Cassaigne; 4. Sesquipowers A. De Luca and S. Varricchio; 5. The plactic monoid A. Lascoux, B. Leclerc and J.-Y. Thibon; 6. Codes V. Bruyère; 7. Numeration systems C. Frougny; 8. Periodicity F. Mignosi and A. Restivo; 9. Centralisers of noncommutative series and polynomials C. Reutenauer; 10. Transformations on words and q-calculus D. Foata and G.-N. Han; 11. Statistics on permutations and words J. Désarménien; 12. Makanin's algorithm V. Diekert; 13. Independent systems of equations T. Harju, J. Karhumäki and W. Plandowski.