{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:56:50Z","timestamp":1776859010913,"version":"3.51.2"},"publisher-location":"London","reference-count":17,"publisher":"Springer London","isbn-type":[{"value":"9781852331962","type":"print"},{"value":"9781447105510","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-1-4471-0551-0_13","type":"book-chapter","created":{"date-parts":[[2011,8,26]],"date-time":"2011-08-26T08:46:19Z","timestamp":1314348379000},"page":"191-204","source":"Crossref","is-referenced-by-count":3,"title":["On Bispecial Words and Subword Complexity of DOL Sequences *"],"prefix":"10.1007","author":[{"given":"A.","family":"Frid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. V.","family":"Avgustinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.36045\/bbms\/1103408543","volume":"1","author":"J-P Allouche","year":"1994","unstructured":"J.-P. Allouche, Sur la complexit\u00e9 des suitesinfinies Bull. Belg. Math. Soc. 1(1994), 133\u2013143.","journal-title":"Bull. Belg. Math. Soc."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-60922-9_45","volume":"1046","author":"M-P B\u00e9ai","year":"1996","unstructured":"M.-P. B\u00e9ai, F. Mignosi, and A. Restivo, Minimal Forbidden Words and Symbolic DynamicsSTACS\u201996Lect. Notes Comp. Sci.1046(1996) 555\u2013566.","journal-title":"Lect. Notes Comp. Sci"},{"key":"13_CR3","first-page":"459","volume":"1","author":"J Cassaigne","year":"1994","unstructured":"J. Cassaigne, An algorithm to test if a given circular HDOL-language avoids a patternIFIP World Computer Congress\u201994Elsevier (North-Holland)1(1994), 459\u2013464.","journal-title":"Elsevier (North-Holland)"},{"key":"13_CR4","first-page":"94","volume":"6","author":"J Cassaigne","year":"1994","unstructured":"J. Cassaigne, Motifs \u00e9vitables et r\u00e9gularit\u00e9s dans les motsTh\u00e8se de DoctoratUniversit\u00e9 Paris 6 (1994). Rapport LITP TH 94\u201304.","journal-title":"Th\u00e8sede Doctorat, Universit\u00e9 Paris"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.36045\/bbms\/1105730624","volume":"4","author":"J Cassaigne","year":"1997","unstructured":"J. Cassaigne, Complexit\u00e9 et facteurs sp\u00e9ciauxBull. Belg. Math. Soc.4(1997), 67\u201388.","journal-title":"Bull. Belg. Math. Soc."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/BFb0055817","volume":"1450","author":"M Crochemore","year":"1998","unstructured":"M. Crochemore, F. Mignosi, and A. Restivo, Minimal Forbidden Words and Factor AutomataMFCS\u201998Lect. Notes Comp. Sci.1450(1998), 665\u2013673.","journal-title":"Lect. Notes Comp. Sci"},{"key":"13_CR7","first-page":"206","volume-title":"Complexity of Sequences and Dynamical Systems Discrete Math","author":"S Ferenczi","year":"1999","unstructured":"S. Ferenczi, Complexity of Sequences and Dynamical SystemsDiscrete Math.206(1999), to appear."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BFb0028589","volume":"1373","author":"A Frid","year":"1998","unstructured":"A. Frid, On Uniform DOL WordsSTACS\u201998Lect. Notes Comp. Sci.1373(1998), 544\u2013554.","journal-title":"Lect. Notes Comp. Sci"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-55719-9_62","volume":"623","author":"V Ker\u00e4nen","year":"1992","unstructured":"V. Ker\u00e4nen, Abelian Squares are Avoidable on 4 LettersICALP\u201992Lect. Notes Comp. Sci.623(1992), 41\u201352.","journal-title":"Lect. Notes Comp. Sci"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BFb0029978","volume":"1295","author":"R Kolpakov","year":"1997","unstructured":"R. Kolpakov, G. Kucherov, Minimal Letter Frequency in n-th Power-free Binary Words.MFCS\u201997Lect. Notes Comp. Sci.1295(1997) 347\u2013357.","journal-title":"Lect. Notes Comp. Sci"},{"key":"13_CR11","volume-title":"\u201cCombinatorics on Words\u201d, Addison-Wesley, Reading, Mass","author":"M Lothaire","year":"1983","unstructured":"M. Lothaire, \u201cCombinatorics on Words\u201d, Addison-Wesley, Reading, Mass., 1983."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/3-540-56939-1_98","volume":"700","author":"F Mignosi","year":"1993","unstructured":"F. Mignosi and P. S\u00e9\u00e9bold, If a DOL language is k -power-free then it is circularICALP\u201993Lect. Notes Comp. Sci.700(1993), 507\u2013518.","journal-title":"Lect. Notes Comp. Sci."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0304-3975(92)90357-L","volume":"99","author":"B Moss\u00e9","year":"1992","unstructured":"B. Moss\u00e9, Puissances de mots et reconnaissabilit\u00e9 des points fixes d\u2019une substitutionTheoret.Comput. Sci.99(1992), 327\u2013334.","journal-title":"Theoret.Comput. Sci."},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.24033\/bsmf.2283","volume":"124","author":"B Moss\u00e9","year":"1996","unstructured":"B. Moss\u00e9, Reconnaissabilit\u00e9 des substitutions et complexit\u00e9 des suites automatiquesBull. Soc. Math. France 124(1996), 329\u2013346.","journal-title":"Bull. Soc. Math. France"},{"key":"13_CR15","volume-title":"On the complexity function of fixed points of substitutions","author":"B Moss\u00e9","year":"1996","unstructured":"B. Moss\u00e9, On the complexity function of fixed points of substitutions (1996), Unpublished."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-13345-3_34","volume":"172","author":"J-J Pansiot","year":"1984","unstructured":"J.-J. Pansiot, Complexit\u00e9 des facteurs des mots infinis engendr\u00e9s par morphismes it\u00e9r\u00e9sICALP\u201984Lect. Notes Comp. Sci.172(1984), 380\u2013389.","journal-title":"Lect. Notes Comp. Sci"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.5802\/jtnb.109","volume":"6","author":"T Tapsoba","year":"1994","unstructured":"T. Tapsoba, Automates calculant la complexit\u00e9 des suites automatiquesJournal de Th\u00e9orie des nombres de Bordeaux 6(1994), 127\u2013134.","journal-title":"Journal deTh\u00e9orie des nombresde Bordeaux"}],"container-title":["Sequences and their Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0551-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T05:39:53Z","timestamp":1605677993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0551-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9781852331962","9781447105510"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0551-0_13","relation":{},"subject":[],"published":{"date-parts":[[1999]]}}}