{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:59:33Z","timestamp":1648529973180},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/0020-0190(82)90109-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"68-71","source":"Crossref","is-referenced-by-count":6,"title":["Permutations are not context-free: An application of the interchange lemma"],"prefix":"10.1016","volume":"15","author":[{"given":"Michael G.","family":"Main","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90109-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(82)90109-0_BIB2","series-title":"Language and Information","article-title":"On formal properties of simple phrase structure grammars","author":"Bar-Hillel","year":"1964"},{"key":"10.1016\/0020-0190(82)90109-0_BIB3","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\/0020-0190(82)90109-0_BIB4","series-title":"Tech. Rept. 80-53","article-title":"Determination optimale des repetitions dans un mot","author":"Crochemore","year":"1981"},{"key":"10.1016\/0020-0190(82)90109-0_BIB5","first-page":"1","article-title":"On the subword complexity and square-freeness of formal languages","volume":"LNCS 104","author":"Ehrenfeucht","year":"1981"},{"key":"10.1016\/0020-0190(82)90109-0_BIB6","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0020-0190(82)90109-0_BIB7","first-page":"148","article-title":"Remarks on the work of Axel Thue on sequences","volume":"15","author":"Hedlund","year":"1967","journal-title":"Nord. Mat. Tidskr."},{"key":"10.1016\/0020-0190(82)90109-0_BIB8","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(82)90109-0_BIB9","article-title":"An O(n log n) algorithm for recognizing repetition","author":"Main","year":"1980","journal-title":"Washington State University Tech. Rept. CS-79-56"},{"key":"10.1016\/0020-0190(82)90109-0_BIB10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01694004","article-title":"A helpful result for proving inherent ambiguity","volume":"2","author":"Ogden","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0020-0190(82)90109-0_BIB11","article-title":"An \u2018interchange\u2019 lemma for context free languages","author":"Ogden","year":"1981","journal-title":"Washington State University Tech. Rept. CS-81-080"},{"key":"10.1016\/0020-0190(82)90109-0_BIB12","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(82)90109-0_BIB13","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\/0020-0190(82)90109-0_BIB14","unstructured":"R.J. Ross and K. Winklmann, Repetitive strings are not context free, RAIRO Informatique Theorique\/Theoretical Informatics, to appear."},{"key":"10.1016\/0020-0190(82)90109-0_BIB15","series-title":"Jewels of Formal Language Theory","author":"Salomaa","year":"1981"},{"key":"10.1016\/0020-0190(82)90109-0_BIB16","first-page":"1","article-title":"Uber unendliche Zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Nor. Vidensk. Selsk. Skr. I. Mat. Kl."},{"key":"10.1016\/0020-0190(82)90109-0_BIB17","series-title":"Automata, Languages and Programming","first-page":"17","article-title":"A generalization of Parikh's theorem in formal language theory","volume":"14","author":"Van Leeuwem","year":"1974"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082901090?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082901090?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:54:36Z","timestamp":1555088076000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082901090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0020019082901090"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90109-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}