{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T06:26:08Z","timestamp":1777011968836,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4184,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00436-9","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"99-117","source":"Crossref","is-referenced-by-count":42,"title":["Words and forbidden factors"],"prefix":"10.1016","volume":"273","author":[{"given":"F.","family":"Mignosi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00436-9_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB2","first-page":"133","article-title":"Sur la complexit\u00e9 des suites infinies","volume":"1","author":"Allouche","year":"1994","journal-title":"Bull. Belg. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB3","first-page":"555","article-title":"Minimal Forbidden words and symbolic dynamics","volume":"vol. 1046","author":"B\u00e9al","year":"1996"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/aama.2000.0682","article-title":"Forbidden words in Symbolic Dynamics","volume":"25","author":"B\u00e9al","year":"2000","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB5","doi-asserted-by":"crossref","unstructured":"J. Berstel, Fibonacci words \u2013 a survey, in: G. Rozenberg, A. Salomaa (Eds.), The Book of L, Springer, Berlin, 1986.","DOI":"10.1007\/978-3-642-95486-3_2"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB6","unstructured":"J. Berstel, P. S\u00e9\u00e9bold, Sturmian words, in: M. Lothaire (Ed.), Algebraic Combinatorics on Words, Cambridge University Press, Cambridge (Chapter 2), to appear. Available at http:\/\/www-igm.univ-mlv.fr\/\u00a0\u0303berstel\/Lothaire."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","article-title":"The smallest automaton recognizing the subwords of a text","volume":"40","author":"Blumer","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)90274-E","article-title":"Enumeration of factors in the Thue\u2013Morse word","volume":"24","author":"Brlek","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB9","doi-asserted-by":"crossref","unstructured":"A. Carpi, A. de Luca. Words and special factors, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/S0304-3975(99)00334-5"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB10","first-page":"67","article-title":"Complexit\u00e9 et facteurs sp\u00e9ciaux","volume":"4","author":"Cassaigne","year":"1997","journal-title":"Bull. Belg. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB11","first-page":"329","article-title":"Combinatorics on words","volume":"vol. 1","author":"Choffrut","year":"1997"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB12","first-page":"399","article-title":"Automata for matching patterns","volume":"vol. 2","author":"Crochemore","year":"1997"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","article-title":"Automata and forbidden words","volume":"67","author":"Crochemore","year":"1998","journal-title":"Inform. Process Lett."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB14","first-page":"261","article-title":"Data Compression using antidictionaries","volume":"vol. 1644","author":"Crochemore","year":"1999"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB15","doi-asserted-by":"crossref","unstructured":"M. Crochemore, F. Mignosi, A. Restivo, S. Salemi, Data compression using antidictionaries, in: J.A. Storer (Ed.), Proceedings of the IEEE, Special Issue on Lossless Data Compression, Vol. 88, 11 (2000) 1756\u20131768.","DOI":"10.1109\/5.892711"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB16","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"De Brujin","year":"1946","journal-title":"Nederl. Akad. Wetensch. Proc."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB17","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0304-3975(94)00035-H","article-title":"Some combinatorial properties of Sturmian words","volume":"136","author":"de Luca","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0020-0190(94)90008-6","article-title":"On bispecial factors of the Thue\u2013Morse word","volume":"49","author":"de Luca","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB19","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(89)90013-3","article-title":"Some combinatorial properties of the Thue\u2013Morse sequence and a problem in semigroups","volume":"63","author":"de Luca","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00436-9_BIB20","volume":"vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB21","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1980"},{"key":"10.1016\/S0304-3975(00)00436-9_BIB22","doi-asserted-by":"crossref","unstructured":"G. Rauzy, Mots infinis en arithm\u00e9tique, in: M .Nivat, D. Perrin (Eds.), Automata on Infinite Words, Lecture Notes in Computer Science, vol. 192, Springer, Berlin, 1984.","DOI":"10.1007\/3-540-15641-0_32"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004369?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004369?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T02:02:26Z","timestamp":1578448946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500004369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500004369"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00436-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}