{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T23:00:27Z","timestamp":1787612427726,"version":"build-2736575974"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,5]]},"abstract":"<jats:p>An \u201cInterchange Lemma\u201d is proven, providing a new necessary condition for languages to be context-free. This \u201cInterchange Lemma\u201d is then used to show that the set of repetitive strings (i.e. strings of the form $xyyz$ with nonempty y) over an alphabet of three or more characters is not context-free\u2014an issue which in the past has shown remarkable resilience against standard tools for proving languages not context-free and which has only recently been solved independently in [5] and [10]. The Interchange Lemma presented in this paper is a generalization of the proof technique used in [10].<\/jats:p>","DOI":"10.1137\/0214031","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"410-415","source":"Crossref","is-referenced-by-count":20,"title":["An \u201cInterchange Lemma\u201d for Context-Free Languages"],"prefix":"10.1137","volume":"14","author":[{"given":"William","family":"Ogden","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rockford J.","family":"Ross","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karl","family":"Winklmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1979130403631"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1979.85.261"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09510-1_2"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.2307\/2311652"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1983170100131"},{"key":"R6","volume-title":"Introduction to formal language theory","author":"Harrison M.","year":"1978"},{"key":"R7","first-page":"148","volume":"15","author":"Hedlund G. A.","year":"1967","journal-title":"Nordisk Mat. Tidskr."},{"key":"R8","volume-title":"Introduction to automata theory, languages, and computation","author":"Hopcroft John E.","year":"1979"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100046077"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1982160301911"},{"key":"R11","volume-title":"Jewels of formal language theory","author":"Salomaa Arto","year":"1981"},{"key":"R12","unstructured":"A. Thue,  \u00dcber unendliche Zeichenreihen,  1906, Norske Videnskabers Selskabs Skrifter Mat.Mat. Kl. (Kristiania), Nr. 7, 00. 1\u201322"},{"key":"R13","unstructured":"A. Thue,  \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen,  1912, Norske Videnskabers Selskabs Skrifter Mat.Nat. Kl. (Kristiania), Nr. 1, pp. 1\u201367"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:55Z","timestamp":1787337775000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["10.1137\/0214031"],"URL":"https:\/\/doi.org\/10.1137\/0214031","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}