@article{DBLP:journals/jct/KarhumakiS04,
  author    = {Juhani Karhum{\"{a}}ki and
               Jeffrey Shallit},
  title     = {Polynomial versus exponential growth in repetition-free binary words},
  journal   = {J. Comb. Theory, Ser. {A}},
  volume    = {105},
  number    = {2},
  pages     = {335--347},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.jcta.2003.12.004},
  doi       = {10.1016/j.jcta.2003.12.004},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jct/KarhumakiS04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"rfx8ttP4vyj5qTwGJ","bibbaseid":"karhumki-shallit-polynomialversusexponentialgrowthinrepetitionfreebinarywords-2004","downloads":0,"creationDate":"2019-01-08T11:55:07.736Z","title":"Polynomial versus exponential growth in repetition-free binary words","author_short":["Karhumäki, J.","Shallit, J."],"year":2004,"bibtype":"article","biburl":"https://dblp.org/pid/s/JeffreyShallit.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Juhani"],"propositions":[],"lastnames":["Karhumäki"],"suffixes":[]},{"firstnames":["Jeffrey"],"propositions":[],"lastnames":["Shallit"],"suffixes":[]}],"title":"Polynomial versus exponential growth in repetition-free binary words","journal":"J. Comb. Theory, Ser. A","volume":"105","number":"2","pages":"335–347","year":"2004","url":"https://doi.org/10.1016/j.jcta.2003.12.004","doi":"10.1016/j.jcta.2003.12.004","timestamp":"Sat, 27 May 2017 01:00:00 +0200","biburl":"https://dblp.org/rec/bib/journals/jct/KarhumakiS04","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/jct/KarhumakiS04,\n author = {Juhani Karhum{\\\"{a}}ki and\n Jeffrey Shallit},\n title = {Polynomial versus exponential growth in repetition-free binary words},\n journal = {J. Comb. Theory, Ser. {A}},\n volume = {105},\n number = {2},\n pages = {335--347},\n year = {2004},\n url = {https://doi.org/10.1016/j.jcta.2003.12.004},\n doi = {10.1016/j.jcta.2003.12.004},\n timestamp = {Sat, 27 May 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/jct/KarhumakiS04},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Karhumäki, J.","Shallit, J."],"key":"DBLP:journals/jct/KarhumakiS04","id":"DBLP:journals/jct/KarhumakiS04","bibbaseid":"karhumki-shallit-polynomialversusexponentialgrowthinrepetitionfreebinarywords-2004","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.jcta.2003.12.004"},"downloads":0},"search_terms":["polynomial","versus","exponential","growth","repetition","free","binary","words","karhumäki","shallit"],"keywords":[],"authorIDs":[],"dataSources":["9bkAHJfQLTCifmTcG"]}