@article(Aberkane&Currie:2005,
 author       = "A. Aberkane and J. D. Currie",
 year         = "2005",
 title        = "Attainable lengths for circular binary words avoiding $k$ powers",
 journal      = "Bull. Belg. Math. Soc.",
 volume       = "12",
 pages        = "525--534",
)
@article(Allouche&Currie&Shallit:1998,
 author       = "J.-P. Allouche and J. Currie and J. Shallit",
 year         = "1998",
 title        = "Extremal infinite overlap-free binary words",
 journal      = "Electron. J. Combinatorics",
 volume       = "5",
 number       = "1",
 url          = "http://www.combinatorics.org/Volume_5/Abstracts/v5i1r27.html",
)
@book(Allouche&Shallit:2003,
 author       = "J.-P. Allouche and J. Shallit",
 year         = "2003",
 title        = "Automatic Sequences: Theory, Applications, Generalizations",
 publisher    = "Cambridge University Press",
)
@incollection(Berstel:1994,
 author       = "J. Berstel",
 year         = "1994",
 title        = "A rewriting of {Fife's} theorem about overlap-free words",
 editor       = "J. {Karhum\"aki} and H. Maurer and G. Rozenberg",
 booktitle    = "Results and Trends in Theoretical Computer Science",
 series       = "Lecture Notes in Computer Science",
 volume       = "812",
 publisher    = "Springer-Verlag",
 pages        = "19--29",
 doi          = "10.1007/3-540-58131-6_34",
)
@article(Blondel&Cassaigne&Jungers:2009,
 author       = "V. D. Blondel and J. Cassaigne and R. M. Jungers",
 year         = "2009",
 title        = "On the number of $\alpha $-power-free binary words for $2 < \alpha \leq 7/3$",
 journal      = "Theoret. Comput. Sci.",
 volume       = "410",
 pages        = "2823--2833",
 doi          = "10.1016/j.tcs.2009.01.031",
)
@article(Carpi:1993a,
 author       = "A. Carpi",
 year         = "1993",
 title        = "Overlap-free words and finite automata",
 journal      = "Theoret. Comput. Sci.",
 volume       = "115",
 pages        = "243--260",
 doi          = "10.1016/0304-3975(93)90118-D",
)
@incollection(Cassaigne:1993b,
 author       = "J. Cassaigne",
 year         = "1993",
 title        = "Counting overlap-free binary words",
 editor       = "P. Enjalbert and A. Finkel and K. W. Wagner",
 booktitle    = "STACS 93, Proc. 10th Symp. Theoretical Aspects of Comp. Sci.",
 series       = "Lecture Notes in Computer Science",
 volume       = "665",
 publisher    = "Springer-Verlag",
 pages        = "216--225",
 doi          = "10.1007/3-540-56503-5_24",
)
@article(Fife:1980,
 author       = "E. D. Fife",
 year         = "1980",
 title        = "Binary sequences which contain no {$BBb$}",
 journal      = "Trans. Amer. Math. Soc.",
 volume       = "261",
 pages        = "115--136",
 doi          = "10.1090/S0002-9947-1980-0576867-5",
)
@article(Karhumaki&Shallit:2004,
 author       = "J. {Karhum\"aki} and J. Shallit",
 year         = "2004",
 title        = "Polynomial versus exponential growth in repetition-free binary words",
 journal      = "J. Combin. Theory. Ser. A",
 volume       = "105",
 pages        = "335--347",
 doi          = "10.1016/j.jcta.2003.12.004",
)
@incollection(Kolpakov&Kucherov:1997,
 author       = "R. Kolpakov and G. Kucherov",
 year         = "1997",
 title        = "Minimal letter frequency in $n$-th power-free binary words",
 editor       = "I. Privara and P. Ru\v {z}i\v {c}ka",
 booktitle    = "Proc. of the 22nd Symposium, Math. Found. Comput. Sci. (MFCS) 1997",
 series       = "Lecture Notes in Computer Science",
 volume       = "1295",
 publisher    = "Springer-Verlag",
 pages        = "347--357",
 doi          = "10.1007/BFb0029978",
)
@article(Rampersad:2005,
 author       = "N. Rampersad",
 year         = "2005",
 title        = "Words avoiding $7/3$-powers and the Thue-Morse morphism",
 journal      = "Int. J. Found. Comput. Sci.",
 volume       = "16",
 pages        = "755--766",
 doi          = "10.1142/S0129054105003273",
)
@incollection(Restivo&Salemi:1985a,
 author       = "A. Restivo and S. Salemi",
 year         = "1985",
 title        = "Overlap free words on two symbols",
 editor       = "M. Nivat and D. Perrin",
 booktitle    = "Automata on Infinite Words",
 series       = "Lecture Notes in Computer Science",
 volume       = "192",
 publisher    = "Springer-Verlag",
 pages        = "198--206",
 doi          = "10.1007/3-540-15641-0_35",
)
@unpublished(Shallit:2011,
 author       = "J. Shallit",
 title        = "Fife's theorem revisited",
 url          = "http://arxiv.org/abs/1102.3932",
 note         = "To appear, DLT 2011",
)
@article(Shur:2000,
 author       = "A. M. Shur",
 year         = "2000",
 title        = "The structure of the set of cube-free $Z$-words in a two-letter alphabet",
 journal      = "Izv. Ross. Akad. Nauk Ser. Mat.",
 volume       = "64",
 number       = "4",
 pages        = "201--224",
 note         = "In Russian. English translation in {\it Izv. Math.} 64 (2000), pp.\ 847--871",
)