Abstract
Words (strings of symbols) are fundamental in computer processing. Indeed, each bit of data processed by a computer is a string, and nearly all computer software use algorithms on strings. There are also abundant supply of applications of these algorithms in other areas such as data compression, DNA sequence analysis, computer graphics, cryptography, and so on.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bean, D.R., Ehrenfeucht, A., McNulty, G.: Avoidable patterns in strings of symbols. Pacific J. Math., 85 (1979), 261–294.
Berstel, J.: Axel Thues work on repetitions in words. In P. Leroux, C. Reutenauer (Eds.) Séries Formelles et Combinatoire Algébrique (Number 11 in Publications du LACIM, Université du Québec â Montréal, 1992 ), pp 65–80.
Carpi, A., de Luca, A.: Words and special factors. Theoret. Comput. Sci., 259 (2001), 145–182.
Cassaigne, J.: Unavoidable binary patterns. Acta Inf, 30 (1993), 385–395.
Choffrut, C., Karhumäki, J.: Combinatorics of words. In G. Rozenberg, A. Salomaa (Eds.) Handbook of Formal Languages, Vol. 1 (Springer-Verlag, 1997 ), pp 329–438.
de Luca, A.: On the combinatorics of finite words. Theoret. Comput. Sci., 218 (1999), 13–39.
Halava, V., Harju, T., Ilie, I.: Periods and binary words. J. Combin. Theory Ser. A, 89 (2000), 298–303.
Harju, T.: On factorizations of words. Bulletin EATCS, 24 (1984), 217.
Harju, T., Karhumäki, J.: On the many faces of the defect theorem, submitted for publication. Technical Report 358, Turku Centre for Computer Science, TUCS, 1998.
Harju, T., Nowotka, D.: On the density of critical factorizations, submitted, 2001.
Lothaire, M.: Combinatorics on Words (Addison-Wesley, 1983).
Lothaire, M.: Algebraic Combinatorics on Words (Cambridge University Press, 2002).
Mignosi, F., Restivo, A., Salemi, S.: Periodicity and the golden ratio. Theoret. Comput. Sci., 204 (1998), 153–167.
Skordev, D., Sendov, Bl.: On equations in words (in russian). Z. Math. Logic Grundlagen Math., 7 (1961), 289–297.
Zimin, A.: Blocking sets of terms. Mat. Sb. (N.S.), 119 (161) (1982);
Zimin, A.: Blocking sets of terms. Math. USSR Sb., 47 (1984), 353–364.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Harju, T. (2004). Combinatorics on Words. In: Martín-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-39886-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53554-3
Online ISBN: 978-3-540-39886-8
eBook Packages: Springer Book Archive