% Encoding: UTF-8
@article{DBLP:journals/corr/NagashimaK16,
  author    = {Yutaka Nagashima and
               Ramana Kumar},
  title     = {A Proof Strategy Language and Proof Script Generation for Isabelle},
  journal   = {CoRR},
  volume    = {abs/1606.02941},
  year      = {2016},
  url       = {http://arxiv.org/abs/1606.02941},
  timestamp = {Fri, 01 Jul 2016 17:39:49 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/NagashimaK16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}


@Book{Lo83,
  author =  "M. Lothaire",
  title = "Combinatorics on Words",
  publisher = "Addison-Wesley, Reading, Mass.",
  year =  "1983",
  series =  "Encyclopaedia of Mathematics and its Applications",
  volume =  "17",
  note =  "Reprinted in the {\em Cambridge Mathematical Library}, Cambridge University Press, Cambridge UK, 1997",
}

@Book{Lo2,
  author =   {M. Lothaire},
  title =    {Algebraic Combinatorics on Words},
  publisher =    {Cambridge University Press},
  year =   {2002},
  number =   {90},
  series =   {Encyclopedia of Mathematics and its Applications}
}

@book{Lo3,
  author    = {M. Lothaire},
  title     = {Applied Combinatorics on Words},
  publisher = {Cambridge University Press},
  year      = {2005},
  isbn      = {978-0-521-84802-2},
  series = {Encyclopedia of Mathematics and its Applications},
 number = {105}
}


@incollection{rampersad_shallit_2016,
place={Cambridge}, series={Encyclopedia of Mathematics and its Applications}, title={Repetitions in words}, DOI={10.1017/CBO9781139924733.005}, booktitle={Combinatorics, Words and Symbolic Dynamics}, publisher={Cambridge University Press}, author={Rampersad, N. and Shallit, J.}, editor={Berthé, Valérie and Rigo, MichelEditors}, year={2016}, pages={101--150}, collection={Encyclopedia of Mathematics and its Applications}}


@incollection{halava_harju_karki_2016,
place={Cambridge}, series={Encyclopedia of Mathematics and its Applications}, title={Similarity relations on words}, DOI={10.1017/CBO9781139924733.007}, booktitle={Combinatorics, Words and Symbolic Dynamics}, publisher={Cambridge University Press}, author={Halava, V. and Harju, T. and Kärki, T.}, editor={Berthé, Valérie and Rigo, MichelEditors}, year={2016}, pages={175--212}, collection={Encyclopedia of Mathematics and its Applications}}

@article{EHRENFEUCHT1979,
title = "Periodicity and unbordered segments of words",
journal = "Discrete Mathematics",
volume = "26",
number = "2",
pages = "101 - 109",
year = "1979",
issn = "0012-365X",
doi = "https://doi.org/10.1016/0012-365X(79)90116-X",
url = "http://www.sciencedirect.com/science/article/pii/0012365X7990116X",
author = "Andrzej Ehrenfeucht and D.M. Silberger",
abstract = "A nonempty word β is said to be a border of a word α if and only if α = λβ = βρ for some nonempty words λ and ρ. For an arbitrary (possibly infinite) sequence α the expression # α denotes the (possibly infinite) supremum of the set of all |β| for β an unbordered finite segment of α."
}


@inbook{ChoKa97,
author = {Choffrut, Christian and Karhum\"{a}ki, Juhani},
title = {Combinatorics of Words},
year = {1997},
isbn = {3540604200},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
booktitle = {Handbook of Formal Languages, Vol. 1: Word, Language, Grammar},
pages = {329--438},
numpages = {110}
}

@article{LySch62,
  author = {R. C. Lyndon and P. Sch\"utzenberger},
 title = {The equation $a^M=b^Nc^P$ in a free group},
 journal = {Michigan Math. J.},
  volume = {9},
  pages = {289--298},
  year = 1962
}


@article{Lyndon54,
  doi = {10.1090/s0002-9947-1954-0064049-x},
  year = {1954},
  month = feb,
  publisher = {American Mathematical Society ({AMS})},
  volume = {77},
  number = {2},
  pages = {202--202},
  author = {R. C. Lyndon},
  title = {On {B}urnside's problem},
  journal = {Transactions of the American Mathematical Society}
}

@article{Duval80,
     author = {Duval, Jean-Pierre},
     title = {Mots de {L}yndon et p\'eriodicit\'e},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {181--191},
     publisher = {EDP-Sciences},
     volume = {14},
     number = {2},
     year = {1980},
     zbl = {0444.20048},
     mrnumber = {581676},
     language = {fr},
}

@article{Duval83,
  doi = {10.1016/0196-6774(83)90017-2},
  url = {https://doi.org/10.1016/0196-6774(83)90017-2},
  year = {1983},
  month = dec,
  publisher = {Elsevier {BV}},
  volume = {4},
  number = {4},
  pages = {363--381},
  author = {Jean Pierre Duval},
  title = {Factorizing words over an ordered alphabet},
  journal = {Journal of Algorithms}
}

@Comment{jabref-meta: databaseType:bibtex;}
