{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T12:05:36Z","timestamp":1648555536172},"reference-count":12,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.63.11","type":"journal-article","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T07:24:58Z","timestamp":1313565898000},"page":"71-82","source":"Crossref","is-referenced-by-count":0,"title":["Recurrent Partial Words"],"prefix":"10.4204","volume":"63","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[{"name":"University of North Carolina at Greensboro"}]},{"given":"Aleksandar","family":"Chakarov","sequence":"additional","affiliation":[{"name":"University of Colorado at Boulder"}]},{"given":"Lucas","family":"Manuelli","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Jarett","family":"Schwartz","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Slater","family":"Stich","sequence":"additional","affiliation":[{"name":"Princeton University"}]}],"member":"2720","published-online":{"date-parts":[[2011,8,17]]},"reference":[{"key":"All","first-page":"133","article-title":"Sur la complexit\u00e9 des suites infinies","volume":"1","author":"Jean-Paul Allouche","year":"1994","journal-title":"Bulletin of the Belgium Mathematical Society"},{"key":"DBLP:books\/daglib\/0025558","doi-asserted-by":"crossref","volume-title":"Automatic Sequences - Theory, Applications, Generalizations","author":"Jean-Paul Allouche","year":"2003","DOI":"10.1017\/CBO9780511546563"},{"issue":"1","key":"DBLP:journals\/tcs\/BerstelB99","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","article-title":"Partial Words and a Theorem of Fine and Wilf","volume":"218","author":"Jean Berstel","year":"1999","journal-title":"Theor. Comput. Sci."},{"key":"BSbook","volume-title":"Algorithmic Combinatorics on Partial Words","author":"Francine Blanchet-Sadri","year":"2008"},{"key":"DBLP:conf\/tamc\/Blanchet-SadriSSW10","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-13562-0_13","article-title":"Binary De Bruijn Partial Words with One Hole","volume-title":"TAMC","author":"Francine Blanchet-Sadri","year":"2010"},{"issue":"1","key":"Cas97","first-page":"67","article-title":"Complexit\u00e9 et facteurs sp\u00e9ciaux","volume":"4","author":"Julien Cassaigne","year":"1997","journal-title":"Bulletin of the Belgium Mathematical Society"},{"key":"DBLP:conf\/stacs\/Cassaigne01","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44693-1_1","article-title":"Recurrence in Infinite Words","volume-title":"STACS","author":"Julien Cassaigne","year":"2001"},{"key":"DBLP:journals\/dm\/Ferenczi99","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0012-365X(98)00400-2","article-title":"Complexity of sequences and dynamical systems","volume":"206","author":"S\u00e9bastien Ferenczi","year":"1999","journal-title":"Discrete Mathematics"},{"key":"Ghe","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.aam.2006.04.001","article-title":"The subword complexity of a class of infinite binary words","volume":"39","author":"Irina Gheorghiciuc","year":"2007","journal-title":"Advances in Applied Mathematics"},{"key":"DBLP:conf\/lata\/ManeaT10","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-13089-2_36","article-title":"Hard Counting Problems for Partial Words","volume-title":"LATA","author":"Florin Manea","year":"2010"},{"key":"MoHe38","doi-asserted-by":"crossref","first-page":"815","DOI":"10.2307\/2371264","article-title":"Symbolic dynamics","volume":"60","author":"Marston Morse","year":"1938","journal-title":"American Journal of Mathematics"},{"key":"Rau","first-page":"2501","article-title":"Suites \u00e0 termes dans un alphabet fini","volume":"25","author":"G. Rauzy","year":"1982\u201383","journal-title":"S\u00e9minaire de Th\u00e9orie des Nombres de Bordeaux"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T04:50:15Z","timestamp":1497934215000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1108.3623v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,17]]},"references-count":12,"URL":"http:\/\/dx.doi.org\/10.4204\/eptcs.63.11","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,17]]}}}
