{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:11:48Z","timestamp":1649117508590},"reference-count":22,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0304-3975(87)90003-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"113-119","source":"Crossref","is-referenced-by-count":5,"title":["Applications of an infinite square-free co-CFL"],"prefix":"10.1016","volume":"49","author":[{"given":"Michael G.","family":"Main","sequence":"first","affiliation":[]},{"given":"Walter","family":"Bucher","sequence":"additional","affiliation":[]},{"given":"David","family":"Haussler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90003-X_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(78)90365-0","article-title":"A note on 1-locally linear languages","volume":"37","author":"Autebert","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(87)90003-X_BIB2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1051\/ita\/1979130403631","article-title":"Quelques problems ouverts en th\u00e9orie des languages alg\u00e9briques","volume":"13","author":"Autebert","year":"1979","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(87)90003-X_BIB3","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"89","article-title":"Very small families of algebraic nonrational languages","author":"Autebert","year":"1980"},{"key":"10.1016\/0304-3975(87)90003-X_BIB4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","article-title":"Avoidable patterns in strings of symbols","volume":"85","author":"Bean","year":"1979","journal-title":"Pacific J. Math."},{"key":"10.1016\/0304-3975(87)90003-X_BIB5","series-title":"Automata Languages and Programming","first-page":"16","article-title":"Sur les mots sans carr\u00e9 definis par un morphisme","volume":"71","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(87)90003-X_BIB6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(80)90151-X","article-title":"Mots sans carr\u00e9 et morphismes iter\u00e9s","volume":"29","author":"Berstel","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(87)90003-X_BIB7","first-page":"361","article-title":"Every iterated morphism yields a co-CFL","volume":"24","author":"Berstel","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(87)90003-X_BIB8","doi-asserted-by":"crossref","unstructured":"J. Berstel and C. Reutenauer, Square-free words and idempotent semigroups, in: M. Lothaire, ed., Combinatorics on Words (Addison-Wesley, Reading, MA Chapter 2).","DOI":"10.1017\/CBO9780511566097.005"},{"key":"10.1016\/0304-3975(87)90003-X_BIB9","series-title":"Internat. Conf. on Automata and Programming Languages","first-page":"359","article-title":"Un crit\u00e8re de rationalit\u00e9 des langages alg\u00e9briques","author":"Boasson","year":"1972"},{"key":"10.1016\/0304-3975(87)90003-X_BIB10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(85)90162-8","article-title":"On total regulators generated by derivation relations","volume":"40","author":"Bucher","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90003-X_BIB11","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1137\/0210039","article-title":"Pumping lemmas for regular sets","volume":"10","author":"Ehrenfeucht","year":"1981","journal-title":"SIAM J. of Comput."},{"key":"10.1016\/0304-3975(87)90003-X_BIB12","first-page":"19","article-title":"Some applications of the interchange lemma","author":"Gabarro","year":"1985","journal-title":"EACTS Bulletin 25"},{"key":"10.1016\/0304-3975(87)90003-X_BIB13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0020-0190(82)90109-0","article-title":"Permutations are not context-free: an application of the interchange lemma","volume":"15","author":"Main","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(87)90003-X_BIB14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0020-0190(85)90073-0","article-title":"An infinite squarefree co-CFL","volume":"20","author":"Main","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(87)90003-X_BIB15","series-title":"Languages Alg\u00e9briques","first-page":"167","article-title":"Introduction aux mono\u00efdes syntactiques des langages alg\u00e9briques","author":"Perrot","year":"1973"},{"key":"10.1016\/0304-3975(87)90003-X_BIB16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1017\/S0305004100046077","article-title":"Nonrepetitive sequences","volume":"68","author":"Pleasants","year":"1970","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"10.1016\/0304-3975(87)90003-X_BIB17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(85)90156-2","article-title":"Rational languages and the Burnside problem","volume":"40","author":"Restivo","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90003-X_BIB18","first-page":"55","article-title":"Mono\u00efdes syntactiques et langages alg\u00e9brique","volume":"7","author":"Sakarovitch","year":"1976"},{"key":"10.1016\/0304-3975(87)90003-X_BIB19","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0304-3975(87)90003-X_BIB20","first-page":"1","article-title":"Uber unendliche Zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske Videnskabers Selskabs Skrifter Mat.-Nat. Kl. (Kristiania)"},{"key":"10.1016\/0304-3975(87)90003-X_BIB21","first-page":"1","article-title":"Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen","volume":"1","author":"Thue","year":"1912","journal-title":"Norske Videnskabers Selskabs Skrifter Mat.-Nat. Kl. (Kristiania)"},{"key":"10.1016\/0304-3975(87)90003-X_BIB22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0019-9958(76)90083-8","article-title":"Locally linear families of languages","volume":"32","author":"van der Walt","year":"1976","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758790003X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758790003X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:44Z","timestamp":1555127504000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758790003X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":22,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["030439758790003X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90003-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}