@incollection{Ehrenfeucht&Rozenberg:1982b,
	key = "Ehrenfeucht and Rozenberg 1982b",
        author = "Ehrenfeucht, A. and Rozenberg, G.",
        title = "Repetitions in homomorphisms and languages",
        booktitle = ICALP82,
	editor = "M. Nielsen and E. M. Schmidt",
        series = LNICS,
        volume = 140,
        publisher = SV,
        year = "{\noopsort{1982b}}1982",
        pages = "192-196"}

@article{Pansiot:1984c,
	key = "Pansiot 1984c",
        author = "Pansiot, J.-J.",
        title = "A propos d'une conjecture de {F. Dejean} sur 
les {r\'ep\'etitions} dans les mots",
        journal = DAM,
        volume = 7,
        year = "{\noopsort{1984c}}1984",
        pages = "297-311"}

@article{Moulin-Ollagnier:1992,
	key = "Moulin-Ollagnier 1992",
	author = "Moulin-Ollagnier, J.",
	title = "Proof of {Dejean's} conjecture for alphabets with $5,6,7,8,9,10$ and $11$ letters",
	journal = TCS,
	volume = 95,
	year = 1992,
	pages = "187-205",
	comment = "checked"}

@article{Crochemore:1981,
	key = "Crochemore 1981",
	author = "Crochemore, M.",
	title = "An optimal algorithm for computing the repetitions in a word",
	journal = IPL,
	volume = 12,
	year = 1981,
	pages = "244-250",
	comment = "checked"}

@incollection{Guibas:1985,
	key = "Guibas 1985",
	author = "Guibas, L.",
	title = "Periodicities in strings",
	booktitle = "Combinatorial Algorithms on Words",
	editor = "A. Apostolico and Z. Galil", 
	year = 1985,
	publisher = SV,
	series = "NATO ASI", 
	volume = "F12",
	pages = "257-269"}

@inproceedings{Allouche:1984,
	key = "Allouche 1984",
        author = "Allouche, J.-P.",
        title = "Suites infinies \`a r\'ep\'etitions born\'ees",
        booktitle = STNB,
        year = "{\noopsort{1984}}1983--1984",
        note = "{Expos\'e} no. 20"}

@article{Dekking:1976,
	key = "Dekking 1976",
	author = "F. M. Dekking",
	title = "On repetitions of blocks in binary sequences",
	journal = JCTA,
	volume = 20,
	year = 1976,
	pages = "292-299",
	comment = "checked"}

@article{Braunholtz:1963,
	key = "Braunholtz 1963",
	author = "C. H. Braunholtz",
	title = "An infinite sequence of three symbols with no
adjacent repeats",
	journal = AMM,
	volume = 70,
	year = 1963,
	pages = "675-676"}

@article{StewartI:1995,
	key = "I. Stewart 1995",
	author = "I. Stewart",
	title = "Mathematical Recreations:  the Never-Ending Chess Game",
	journal = SA,
	volume = 273,
	number = 4,
	month = "October",
	year = 1995,
	pages = "182-183",
	note = "Addenda, {\bf 274} (3) (March 1996), 109."}

@articlenovol{Berstel:1989a,
	key = "Berstel 1989a",
	author = "J. Berstel",
	title = "Langford strings are squarefree",
	journal = BEATCS,
	number = 37,
	month = "February",
	year = "{\noopsort{1989a}}1989",
	pages = "127-129"}

@article{Carpi:1993a,
	key = "Carpi 1993a",
	author = "A. Carpi",
	title = "Overlap-free words and finite automata",
	journal = TCS,
	volume = 115,
	year = "{\noopsort{1993a}}1993",
	pages = "243-260",
	comment = "checked"}

@article{YuX:1995,
	key = "X. Yu 1995",
	author = "X. Yu",
	title = "A new solution for {Thue's} problem",
	journal = IPL,
	volume = 54,
	year = 1995,
	pages = "187-191",
	comment = "checked"}

@article{Crochemore:1983a,
	key = "Crochemore 1983a",
	author = "M. Crochemore",
	title = "Recherche {lin\'eaire} d'un {carr\'e} dans un mot",
	journal = CRASP,
	volume = 296,
	year = "{\noopsort{1983a}}1983",
	pages = "781-784"}

@incollection{Crochemore:1983b,
	key = "Crochemore 1983b",
	author = "M. Crochemore",
	title = "Tests sur les morphismes faiblement sans {carr\'e}",
	booktitle = "Combinatorics on Words:  Progress and Perspectives",
	editor = "L. J. Cummings",
	publisher = AP,
	year = "{\noopsort{1983b}}1983",
	pages = "63-89"}

@incollection{Fife:1983,
	key = "Fife 1983",
	author = "E. D. Fife",
	title = "Irreducible binary sequences",
	booktitle = "Combinatorics on Words:  Progress and Perspectives",
	editor = "L. J. Cummings",
	publisher = AP,
	year = 1983,
	pages = "91-100"}

@incollection{Shelton:1983,
	key = "Shelton 1983",
	author = "R. O. Shelton",
	title = "On the structure and extendibility of square-free words",
	booktitle = "Combinatorics on Words:  Progress and Perspectives",
	editor = "L. J. Cummings",
	publisher = AP,
	year = 1983,
	pages = "101-118"}

@incollection{Berstel:1994,
	key = "Berstel 1994",
	author = "J. Berstel",
	title = "A rewriting of {Fife's} theorem about overlap-free words",
	booktitle = "Results and Trends in Theoretical Computer Science",
	series = LNICS,
	volume = 812,
	editor = "J. {Karhum\"aki} and H. Maurer and G. Rozenberg",
	year = 1994,
	publisher = SV,
	pages = "19-29"}

@incollection{Cummings:1993,
	key = "Cummings 1993",
	author = "L. J. Cummings",
	title = "Gray codes and strongly square-free strings",
	booktitle = "Sequences {II}:  Methods in Communication, Security,
and Computer Science",
	editor = "R. Capocelli and Santis, A. de and U. Vaccaro",
	publisher = SV,
	year = 1993,
	pages = "439-446"}

@article{Shelton&Soni:1985,
	key = "Shelton and Soni 1985",
	author = "R. O. Shelton and R. P. Soni",
	title = "Chains and fixing blocks in irreducible binary sequences",
	journal = DM,
	volume = 54,
	year = 1985,
	pages = "93-99",
	comment = "checked"}

@incollection{Harju:1986,
	key = "Harju 1986",
	author = "T. Harju",
	title = "On cyclically overlap-free words in binary alphabets",
	booktitle = "The Book of L",
	editor = "G. Rozenberg and A. Salomaa",
	publisher = SV,
	year = 1986,
	pages = "125-130"}

@article{Dekking:1979b,
	key = "Dekking 1979b",
	author = "F. M. Dekking",
	title = "Strongly non-repetitive sequences and
progression-free sets",
	journal = JCTA,
	volume = 27,
	year = "{\noopsort{1979b}}1979",
	pages = "181-185",
	comment = "checked"}

@article{Apostolico:1984,
	key = "Apostolico 1984",
	author = "A. Apostolico",
	title = "On context constrained squares and repetitions in a string",
	journal = RAIRO,
	volume = 18,
	year = 1984,
	pages = "147-159"}

@article{Apostolico&Preparata:1983,
	key = "Apostolico and Preparata 1983",
	author = "A. Apostolico and F. P. Preparata",
	title = "Optimal off-line detection of repetitions in a string",
	journal = TCS,
	volume = 22,
	year = 1983,
	pages = "297-315",
	comment = "checked"}

@incollection{Kosaraju:1994,
	key = "Kosaraju 1994",
	author = "S. R. Kosaraju",
	title = "Computation of squares in a string",
	booktitle = CPM94,
	editor = "M. Crochemore and D. Gusfield",
	publisher = SV,
	series = LNICS,
	volume = 807,
	year = 1994,
	pages = "146-150"}

@articlenovol{Wegner:1982,
	key = "Wegner 1982",
	author = "L. Wegner",
	title = "Problem {P12}:   is {$w w w^R$} cube-free?",
	journal = BEATCS,
	number = 18,
	month = "October",
	year = "1982",
	pages = "120"}

@book{Berstel:1995,
	key = "Berstel 1995",
	author = "J. Berstel",
	title = "Axel {Thue's} Papers on Repetitions in Words:  a Translation",
	series = "Publications du Laboratoire de Combinatoire et
d'Informatique {Math\'ematique}",
	publisher = "Universit\'e du Qu\'ebec \`a Montr\'eal",
	number = 20,
	month = "February",
	year = 1995}

@article{Zimin:1982,
	key = "Zimin 1982",
	author = "A. I. Zimin",
	title = "Blocking sets of terms",
	journal = MS,
	volume = 119,
	year = 1982,
	pages = "363-375, 447",
	note = "In Russian.  English translation in
{\it Math. USSR Sbornik}, {\bf 47} (1984), 353--364"}

@article{Keranen:1986,
	key = "{Ker\"anen} 1986",
	author = "V. {Ker\"anen}",
	title = "On the $k$-freeness of morphisms on free monoids",
	journal = AASF,
	volume = 61,
	year = 1986,
	pages = "1-55"}

@book{Guy:1994,
	key = "Guy 1994",
	author = "R. K. Guy",
	title = "Unsolved Problems in Number Theory",
	publisher = SV,
	year = 1994,
	edition = "2nd"}

@article{Berstel:1980a,
	key = "Berstel 1980a",
	author = "J. Berstel",
	title = "Mots sans {carr\'e} et morphismes {it\'er\'es}",
	journal = DM,
	volume = 29,
	year = "{\noopsort{1980a}}1980",
	pages = "235-244",
	comment = "checked"}

@incollection{Berstel:1979,
	key = "Berstel 1979",
	author = "J. Berstel",
	title = "Sur les mots sans {carr\'e} {d\'efinis} par un morphisme",
	booktitle = ICALP79,
	series = LNICS,
	volume = 71,
	editor = "H. A. Maurer",
	year = 1979,
	publisher = SV,
	pages = "16-25"}

@articlenovol{Keranen:1983,
	key = "{Ker\"anen} 1983",
	author = "V. {Ker\"anen}",
	title = "On {L. Wegner's} problem in the general case",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = "{\noopsort{1983}}1983",
	pages = "24-31"}

@article{Currie:1996,
	key = "Currie 1996",
	author = "J. D. Currie",
	title = "Non-repetitive words:  ages and essences",
	journal = COMB,
	volume = 16,
	year = 1996,
	pages = "19-40"}

@article{Currie&Bendor-Samuel:1992,
	key = "Currie and Bendor-Samuel 1992",
	author = "J. Currie and A. Bendor-Samuel",
	title = "Words without near-repetitions",
	journal = CMB,
	volume = 35,
	year = 1992,
	pages = "161-166"}

@article{Cummings:1983a,
	key = "Cummings 1983a",
	author = "L. J. Cummings",
	title = "Strongly $q$th power-free strings",
	journal = ADM,
	volume = 17,
	year = "{\noopsort{1983a}}1983",
	pages = "247-252"}

@article{Kobayashi:1988,
	key = "Kobayashi 1988",
	author = "Y. Kobayashi",
	title = "Enumeration of irreducible binary words",
	journal = DAM,
	volume = 20,
	year = 1988,
	pages = "221-232",
	comment = "checked"}

@article{deLuca&Varricchio:1990,
	key = "de Luca and Varricchio 1990",
	author = "Luca, A. de and S. Varricchio",
	title = "A combinatorial theorem on $p$-power-free words
and an application to semigroups",
	journal = RAIRO,
	volume = 24,
	year = 1990,
	pages = "205-228"}

@article{Cummings:1996,
	key = "Cummings 1996",
	author = "L. J. Cummings",
	title = "Strongly square-free strings on three letters",
	journal = AJC,
	volume = 14,
	year = 1996,
	pages = "259-266"}

@article{Cummings&Smyth:1997,
	key = "Cummings and Smyth 1997",
	author = "L. J. Cummings and W. F. Smyth",
	title = "Weak repetitions in strings",
	journal = JCMCC,
	volume = 24,
	year = 1997,
	pages = "33-48"}

@article{Carpi:1993b,
	key = "Carpi 1993b",
	author = "A. Carpi",
	title = "On abelian power-free morphisms",
	journal = IJAC,
	volume = 3,
	year = "{\noopsort{1993b}}1993",
	pages = "151-167"}

@article{Hawkins&Mientka:1956,
	key = "Hawkins and Mientka 1956",
	author = "D. Hawkins and W. E. Mientka",
	title = "On sequences which contain no repetitions",
	journal = MSTUD,
	volume = 24,
	year = 1956,
	pages = "185-187"}

@book{Lallement:1979,
	key = "Lallement 1979",
	author = "G. Lallement",
	title = "Semigroups and Combinatorial Applications",
	publisher = "John Wiley \& Sons",
	year = 1979}

@article{Hinz:1996,
	key = "Hinz 1996",
	author = "A. M. Hinz",
	title = "Square-free tower of {Hanoi} sequences",
	journal = EM,
	volume = 42,
	year = 1996,
	pages = "257-264"}

@article{Currie:1984,
	key = "Currie 1984",
	author = "J. D. Currie",
	title = "A direct proof of a result of {Thue}",
	journal = UM,
	volume = 25,
	year = 1984,
	pages = "299-302"}

@article{deLuca:1984,
	key = "de Luca 1984",
	author = "Luca, A. de",
	title = "On the product of square-free words",
	journal = DM,
	volume = 52,
	year = 1984,
	pages = "143-157",
	comment = "checked"}

@incollection{Karhumaki:1981,
	key = "Karhum{\"a}ki 1981",
	author = "J. Karhum{\"a}ki",
	title = "On strongly cube-free $\omega$-words generated by
binary morphisms",
	booktitle = FCT81,
	editor = "{F. G\'ecseg}",
	series = LNICS,
	publisher = SV,
	volume = 117,
	year = 1981,
	pages = "182-189"}

@articlenovol{Berstel:1982,
	key = "Berstel 1982",
	author = "J. Berstel",
	title = "Three questions on square-free words",
	journal = BEATCS,
	number = 17,
	month = "June",
	year = 1982,
	pages = "178"}

@articlenovol{Carpi:1983b,
	key = "Carpi 1983b",
	author = "A. Carpi",
	title = "A solution to {Berstel's} problem no. {P1}",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = "{\noopsort{1983b}}1983",
	pages = "2-4"}

@articlenovol{DeFelice:1983,
	key = "De Felice 1983",
	author = "{De Felice}, C.",
	title = "An answer to {Berstel's} problem n. {P2}",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = 1983,
	pages = "5-7"}

@articlenovol{Crochemore:1982b,
	key = "Crochemore 1982b",
	author = "M. Crochemore",
	title = "A solution to {Berstel's} problem no. {P3}",
	journal = BEATCS,
	number = 18,
	month = "October",
	year = "{\noopsort{1982b}}1982",
	pages = "9-11"}

@articlenovol{Arnold:1983,
	key = "Arnold 1983",
	author = "A. Arnold",
	title = "Solution to problem 12",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = 1983,
	pages = "12-13"}

@articlenovol{Boasson:1983,
	key = "Boasson 1983",
	author = "L. Boasson",
	title = "An answer to {P12}: {$w w w^R$} is cube-free",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = 1983,
	pages = "13-14"}

@articlenovol{Crochemore:1983c,
	key = "Crochemore 1983c",
	author = "M. Crochemore",
	title = "A solution to {P12}, number 18, {October} 1982",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = "{\noopsort{1983c}}1983",
	pages = "15-16"}

@articlenovol{Ehrenfeucht&Rozenberg:1983e,
	key = "Ehrenfeucht and Rozenberg 1983e",
	author = "A. Ehrenfeucht and G. Rozenberg",
	title = "A solution to {P12}",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = "{\noopsort{1983e}}1983",
	pages = "16-18"}
	
@articlenovol{Harju:1983,
	key = "Harju 1983",
	author = "T. Harju",
	title = "On repetition free morphisms",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = 1983,
	pages = "18-20"}

@articlenovol{Klop:1983,
	key = "Klop 1983",
	author = "J. W. Klop",
	title = "A solution to problem {P12}
(number 18, {October} 1982)",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = 1983,
	pages = "31-33"}

@articlenovol{Skyum:1983,
	key = "Skyum 1983",
	author = "S. Skyum",
	title = "A solution to {P12}, number 18, {October} 1982",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = 1983,
	pages = "34-37"}

@articlenovol{Verraedt&DeBra&Gyssens:1983,
	key = "Verraedt, De Bra, and Gyssens 1983",
	author = "R. Verraedt and {De Bra}, P. and M. Gyssens",
	title = "A solution to {P12}",
	journal = BEATCS,
	number = 19,
	month = "February",
	year = 1983,
	pages = "37-39"}

@article{Carpi:1998,
	key = "Carpi 1998",
	author = "A. Carpi",
	title = "On the number of {Abelian} square-free words on four letters",
	journal = DAM,
	volume = 81,
	year = 1998,
	pages = "155-167"}

@article{Read:1979,
	key = "Read 1979",
	author = "R. C. Read",
	title = "Problem no. 32:  Sequences avoiding repeated subsequences",
	journal = ANYAS,
	volume = 319,
	year = 1979,
	pages = "586-587",
	note = "Proc. 2nd Int'l. Conf. Combinat. Math."}

@article{Restivo:1977,
	key = "Restivo 1977",
	author = "A. Restivo",
	title = "Mots sans {r\'ep\'etitions} et langages rationnels {born\'es}",
	journal = RAIRO,
	volume = 11,
	year = 1977,
	pages = "197-202"}

@article{Klosinski&Alexanderson&Larson:1985,
	key = "Klosinski, Alexanderson, and Larson 1985",
	author = "Klosinski, L. F. and Alexanderson, G. L. and Larson, L. C.",
	title = "The {William Lowell Putnam} mathematical competition",
	journal = AMM,
	volume = 92,
	year = 1985,
	pages = "560-567",
	comment = "checked"}

@article{Lyndon:1951,
	key = "Lyndon 1951",
	author = "R. C. Lyndon",
	title = "Advanced problem 4454",
	journal = AMM,
	volume = 58,
	year = 1951,
	pages = "569",
	note = "Solution by W. Gustin, {\bf 60} (1953), 51"}

@article{Fraenkel&Simpson:1998,
	key = "Fraenkel and Simpson 1998",
	author = "A. S. Fraenkel and J. Simpson",
	title = "How many squares can a string contain?",
	journal = JCTA,
	volume = 82,
	year = 1998,
	pages = "112-120"}

@incollection{Fraenkel&Simpson&Paterson:1997,
	key = "Fraenkel, Simpson, and Paterson 1997",
	author = "A. S. Fraenkel and J. Simpson and M. Paterson",
	title = "On weak circular squares in binary words",
	booktitle = CPM97,
	editor = "A. Apostolico and J. Hein",
	publisher = SV,
	year = 1997,
	series = LNICS,
	volume = 1264,
	pages = "76-82"}

@article{Apostolico&Breslauer:1996,
	key = "Apostolico and Breslauer 1996",
	author = "A. Apostolico and D. Breslauer",
	title = "An optimal {$O(\log\log N)$}-time parallel algorithm
for detecting all squares in a string",
	journal = SIAMJC,
	volume = 25,
	year = 1996,
	pages = "1318-1331"}

@article{Crochemore&Rytter:1991,
	key = "Crochemore and Rytter 1991",
	author = "M. Crochemore and W. Rytter",
	title = "Efficient parallel algorithms to test square-freeness
and factorize strings",
	journal = IPL,
	volume = 38,
	year = 1991,
	pages = "57-60"}

@article{Crochemore:1986,
	key = "Crochemore 1986",
	author = "M. Crochemore",
	title = "Transducers and repetitions",
	journal = TCS,
	volume = 45,
	year = 1986,
	pages = "63-86"}

@incollection{Apostolico&Breslauer&Galil:1992,
	key = "Apostolico, Breslauer, and Galil 1992",
	author = "A. Apostolico and D. Breslauer and Z. Galil",
	title = "Optimal parallel algorithms for periods, palindromes, and squares",
	booktitle = ICALP92,
	editor = "W. Kuich",
	series = LNICS,
	volume = 623,
	year = 1992,
	publisher = SV,
	pages = "296-307"}

@article{Stolboushkin:1983,
	key = "Stolboushkin 1983",
	author = "A. P. Stolboushkin",
	title = "Regular dynamic logic is not interpretable in deterministic
context-free dynamic logic",
	journal = ICTRL,
	volume = 58,
	year = 1983,
	pages = "94-107"}

@article{Urzyczyn:1983,
	key = "Urzyczyn 1983",
	author = "P. Urzyczyn",
	title = "Nontrivial definability by flow-chart programs",
	journal = ICTRL,
	volume = 58,
	year = 1983,
	pages = "59-87"}

@article{Stolboushkin&Taitslin:1983,
	key = "Stolboushkin and Taitslin 1983",
	author = "A. P. Stolboushkin and M. A. Taitslin",
	title = "Deterministic dynamic logic is strictly weaker than dynamic logic",
	journal = ICTRL,
	volume = 57,
	year = 1983,
	pages = "48-55"}

@article{Kfoury:1985,
	key = "Kfoury 1985",
	author = "A. J. Kfoury",
	title = "Definability by deterministic and non-deterministic programs
(with applications to first-order dynamic logic)",
	journal = ICTRL,
	volume = 65,
	year = 1985,
	pages = "98-121"}

@incollection{Kolpakov&Kucherov:1997,
	key = "Kolpakov and Kucherov 1997",
        author = "R. Kolpakov and G. Kucherov",
        title = "Minimal letter frequency in $n$-th power-free binary words",
        booktitle = MFCS97,
        year = 1997,
        publisher = SV,
        series = LNICS,
        volume = 1295,
        editor = "I. {Pr\'{\i}vara} and P. {Ru\v zi\v cka}",
        pages = "347-357"}

@earticle{Ekhad&Zeilberger:1998,
	key = "Ekhad and Zeilberger 1998",
	author = "S. B. Ekhad and D. Zeilberger",
	title = "There are more than $2^{(n/17)}$ $n$-letter
ternary square-free words",
	journal = JIS,
	volume = 1,
	year = 1998,
	papernum = "98.1.9",
	url = "http://www.research.att.com/~njas/sequences/JIS/zeil.html"}

@article{Baake&Elser&Grimm:1997,
	key = "Baake, Elser, and Grimm 1997",
	author = "M. Baake and V. Elser and U. Grimm",
	title = "The entropy of square-free words",
	journal = MCM,
	volume = 26,
	year = 1997,
	pages = "13-26"}

@techreport{Currie&Simpson:1998,
	key = "Currie and Simpson 1998",
	author = "J. D. Currie and J. Simpson",
	title = "Non-repetitive tilings",
	institution = "Department of Mathematics, University of Winnipeg",
	number = "UW-MS-98-36",
	year = 1998}
	
@incollection{Kobayashi&Otto&Seebold:1997,
	key = "Kobayashi, Otto, and {S\'e\'ebold} 1997",
	author = "Y. Kobayashi and F. Otto and P. {S\'e\'ebold}",
	title = "A complete characterization of repetitive morphisms
over the two-letter alphabet",
	booktitle = COCOON97,
	editor = "T. Jiang and D. T. Lee",
	series = LNICS,
	volume = 1276,
	year = 1997,
	publisher = SV,
	pages = "393-402"}
	
@article{Carpi:1999,
	key = "Carpi 1999",
	author = "A. Carpi",
	title = "On Abelian squares and substitutions",
	journal = TCS,
	volume = 218,
	year = 1999,
	pages = "61-81"}

@article{Kolpakov&Kucherov&Tarannikov:1999,
	key = "Kolpakov, Kucherov, and Tarannikov 1999",
	author = "R. Kolpakov and G. Kucherov and Y. Tarannikov",
	title = "On repetition-free binary
words of minimal density",
	journal = TCS,
	volume = 218,
	year = 1999,
	pages = "161-175"}

@incollection{Kolpakov&Kucherov&Tarannikov:1998,
	key = "Kolpakov, Kucherov, and Tarannikov 1998",
	author = "R. Kolpakov and G. Kucherov and Y. Tarannikov",
	title = "On repetition-free binary
words of minimal density",
	booktitle = MFCS98,
	series = LNICS,
	volume = 1450,
	year = 1998,
	editor = "L. Brim and J. Gruska and J. {Zlatu\v ska}",
	publisher = SV,
	pages = "683-692"}

@article{Cummings:1997,
	key = "Cummings 1997",
	author = "L. J. Cummings",
	title = "Abelian squares in finite strings",
	journal = JCMCC,
	volume = 24,
	year = 1997,
	pages = "201-208"}

@incollection{Kolpakov&Kucherov:1999a,
	key = "Kolpakov and Kucherov 1999a",
	author = "R. Kolpakov and G. Kucherov",
	title = "On maximal repetitions in words",
	booktitle = FCT99,
	editor = "G. Ciobanu and G. {P\u aun}",
	series = LNICS,
	volume = 1684,
	publisher = SV,
	year = "{\noopsort{1999a}}1999",
	pages = "374-385"}

@incollection{Kolpakov&Kucherov:1999b,
	key = "Kolpakov and Kucherov 1999b",
	author = "R. Kolpakov and G. Kucherov",
	title = "Finding maximal repetitions in a word in linear time",
	booktitle = FOCS99,
	publisher = IEEEPR,
	year = 1999,
	pages = "596-604"}

@articlenovol{Gabarro:1985,
	key = "{Gabarr\'o} 1985",
	author = "J. {Gabarr\'o}",
	title = "Some applications of the interchange lemma",
	journal = BEATCS,
	number = 25,
	month = "February",
	year = 1985,
	pages = "19-21"}

@article{Main:1989,
	key = "Main 1989",
	author = "M. G. Main",
	title = "Detecting leftmost maximal periodicities",
	journal = DAM,
	volume = 25,
	year = 1989,
	pages = "145-153"}

@incollection{Berstel:1992,
	key = "Berstel 1992",
	author = "J. Berstel",
	title = "Axel {Thue's} work on repetitions in words",
	booktitle = "{S\'eries} Formelles et Combinatoire {Alg\'ebrique}",
	series = "Publications du LaCim",
	publisher = "{Universit\'e} du {Qu\'ebec} {\`a} {Montr\'eal}",
	year = 1992,
	volume = 11,
	editor = "P. Leroux and C. Reutenauer",
	pages = "65-80"}

@article{Smyth:2000,
	key = "Smyth 2000",
	author = "W. F. Smyth",
	title = "Repetitive perhaps, but certainly not boring",
	journal = TCS,
	volume = 249,
	year = 2000,
	pages = "343-355"}

@article{Keranen:1984,
	key = "{Ker\"anen} 1984",
	author = "V. {Ker\"anen}",
	title = "On $k$-repetition freeness of length uniform morphisms over
a binary alphabet",
	journal = DAM,
	volume = 9,
	year = 1984,
	pages = "297-300"}

@article{Carpi:1984,
	key = "Carpi 1984",
	author = "A. Carpi",
	title = "On the centers of the set of weakly square-free words
on a two-letter alphabet",
	journal = IPL,
	volume = 19,
	year = 1984,
	pages = "187-190"}

@incollection{Richomme&Wlazinski:2000,
	key = "Richomme and Wlazinski 2000",
	author = "G. Richomme and F. Wlazinski",
	title = "About cube-free morphisms",
	booktitle = STACS00,
	volume = 1770,
	series = LNICS,
	editor = "H. Reichel and S. Tison",
	publisher = SV,
	year = 2000,
	pages = "99-109"}

@article{Richomme&Seebold:1999,
	key = "Richomme and {S\'e\'ebold} 1999",
	author = "G. Richomme and P. {S\'e\'ebold}",
	title = "Characterization of test-sets for overlap-free morphisms",
	journal = DAM,
	volume = 98,
	year = 1999,
	pages = "151-157"}

@article{Allouche&Shallit:2000,
	key = "Allouche and Shallit 2000",
	author = "J.-P. Allouche and J. O. Shallit",
	title = "Sums of digits, overlaps, and palindromes",
	journal = DMTCS,
	volume = 4,
	year = 2000,
	pages = "1-10"}

@earticle{Shallit&Wang:2001,
	key = "Shallit and Wang 2001",
	author = "J. O. Shallit and M.-w. Wang",
	title = "Weakly self-avoiding words and a construction of
{Friedman}",
	journal = EJC,
	volume = 8,
	number = 1,
	year = 2001,
	papernum = "N2",
	url = "http://www.combinatorics.org/Volume_8/Abstracts/v8i1n2.abs.tex"}

@incollection{Karhumaki&Plandowski&Rytter:2000,
	key = "{Karhum\"aki}, Plandowski, and Rytter 2000",
	author = "J. {Karhum\"aki} and W. Plandowski and W. Rytter",
	editor = "G. Rozenberg and W. Thomas",
	title = "On the complexity of computing the order of repetition of a
string",
	booktitle = "Developments in Language Theory 1999",
	year = 2000,
	publisher = WSP,
	pages = "178-184"}

@article{Richomme&Wlazinski:2002,
	key = "Richomme and Wlazinski 2002",
	author = "G. Richomme and F. Wlazinski",
	title = "Some results on $k$-power-free morphisms",
	journal = TCS,
	volume = 273,
	year = 2002,
	pages = "119-142"}

@article{Frid:2001,
	key = "Frid 2001",
	author = "A. E. Frid",
	title = "Overlap-free symmetric {D0L} words",
	journal = DMTCS,
	volume = 4,
	year = 2001,
	pages = "357-362"}

@earticle{Grimm:2001,
	key = "Grimm 2001",
	author = "U. Grimm",
	title = "Improved bounds on the number of ternary
square-free words",
	journal = JIS,
	volume = 4,
	year = 2001,
	papernum = "01.2.7",
	url = "http://www.research.att.com/~njas/sequences/JIS/VOL4/GRIMM/words.html"}

@earticle{Cummings&Mays:2001,
	key = "Cummings and Mays 2001",
	author = "L. J. Cummings and M. Mays",
	title = "A one-sided {Zimin} construction",
	journal = EJC,
	volume = 8,
	number = 1,
	year = 2001,
	papernum = "R27",
	url = "http://www.combinatorics.org/Volume_8/Abstracts/v8i1r27.html"}

@article{Hayes:2001,
	key = "Hayes 2001",
	author = "B. Hayes",
	title = "Third base",
	journal = "American Scientist",
	volume = 89,
	number = 6,
	month = "November-December",
	year = 2001,
	pages = "490-494"}

@article{Wlazinski:2001,
	key = "Wlazinski 2001",
	author = "F. Wlazinski",
	title = "A test-set for $k$-power-free binary morphisms",
	journal = RAIRO,
	volume = 35,
	year = 2001,
	pages = "437-452"}