@article{journals/ijfcs/BrlekHNR04,
  added-at = {2019-06-02T00:00:00.000+0200},
  author = {Brlek, Srecko and Hamel, Sylvie and Nivat, Maurice and Reutenauer, Christophe},
  biburl = {https://www.bibsonomy.org/bibtex/242222903d577accfaec6e8e43a305604/dblp},
  ee = {https://www.wikidata.org/entity/Q60704266},
  interhash = {b7919770b14887a6e120f42e05b49170},
  intrahash = {42222903d577accfaec6e8e43a305604},
  journal = {Int. J. Found. Comput. Sci.},
  keywords = {dblp},
  number = 2,
  pages = {293-306},
  timestamp = {2019-06-04T12:28:47.000+0200},
  title = {On The Palindromic Complexity Of Infinite Words.},
  url = {http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs15.html#BrlekHNR04},
  volume = 15,
  year = 2004
}

{"_id":"mWiSQFdH9g6sCB92t","bibbaseid":"brlek-hamel-nivat-reutenauer-onthepalindromiccomplexityofinfinitewords-2004","author_short":["Brlek, S.","Hamel, S.","Nivat, M.","Reutenauer, C."],"bibdata":{"bibtype":"article","type":"article","added-at":"2019-06-02T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Brlek"],"firstnames":["Srecko"],"suffixes":[]},{"propositions":[],"lastnames":["Hamel"],"firstnames":["Sylvie"],"suffixes":[]},{"propositions":[],"lastnames":["Nivat"],"firstnames":["Maurice"],"suffixes":[]},{"propositions":[],"lastnames":["Reutenauer"],"firstnames":["Christophe"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/242222903d577accfaec6e8e43a305604/dblp","ee":"https://www.wikidata.org/entity/Q60704266","interhash":"b7919770b14887a6e120f42e05b49170","intrahash":"42222903d577accfaec6e8e43a305604","journal":"Int. J. Found. Comput. Sci.","keywords":"dblp","number":"2","pages":"293-306","timestamp":"2019-06-04T12:28:47.000+0200","title":"On The Palindromic Complexity Of Infinite Words.","url":"http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs15.html#BrlekHNR04","volume":"15","year":"2004","bibtex":"@article{journals/ijfcs/BrlekHNR04,\n added-at = {2019-06-02T00:00:00.000+0200},\n author = {Brlek, Srecko and Hamel, Sylvie and Nivat, Maurice and Reutenauer, Christophe},\n biburl = {https://www.bibsonomy.org/bibtex/242222903d577accfaec6e8e43a305604/dblp},\n ee = {https://www.wikidata.org/entity/Q60704266},\n interhash = {b7919770b14887a6e120f42e05b49170},\n intrahash = {42222903d577accfaec6e8e43a305604},\n journal = {Int. J. Found. Comput. Sci.},\n keywords = {dblp},\n number = 2,\n pages = {293-306},\n timestamp = {2019-06-04T12:28:47.000+0200},\n title = {On The Palindromic Complexity Of Infinite Words.},\n url = {http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs15.html#BrlekHNR04},\n volume = 15,\n year = 2004\n}\n\n","author_short":["Brlek, S.","Hamel, S.","Nivat, M.","Reutenauer, C."],"key":"journals/ijfcs/BrlekHNR04","id":"journals/ijfcs/BrlekHNR04","bibbaseid":"brlek-hamel-nivat-reutenauer-onthepalindromiccomplexityofinfinitewords-2004","role":"author","urls":{"Link":"https://www.wikidata.org/entity/Q60704266","Paper":"http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs15.html#BrlekHNR04"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Hamel?items=1000","dataSources":["8T57PzJcnd8btZq9P"],"keywords":["dblp"],"search_terms":["palindromic","complexity","infinite","words","brlek","hamel","nivat","reutenauer"],"title":"On The Palindromic Complexity Of Infinite Words.","year":2004}