{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:29Z","timestamp":1760202629792},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_39","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"458-467","source":"Crossref","is-referenced-by-count":2,"title":["Ogden\u2019s Lemma for ET0L Languages"],"prefix":"10.1007","author":[{"given":"Max","family":"Rabkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"39_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0019-9958(79)90642-9","volume":"43","author":"J. Beauquier","year":"1979","unstructured":"Beauquier, J.: Deux familles de langages incomparables. Information and Control\u00a043(2), 101\u2013122 (1979)","journal-title":"Information and Control"},{"key":"39_CR2","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. EATCS Monographs on Theoretical Computer Science. Springer, Berlin (1989)"},{"key":"39_CR3","unstructured":"Ehrenfeucht, A., Rozenberg, G.: A pumping theorem for EDT0L languages. Tech. Rep. CU-CS-047-74, University of Colorado (1974)"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF00268142","volume":"6","author":"A. Ehrenfeucht","year":"1976","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On proving that certain languages are not ETOL. Acta Informatica\u00a06, 407\u2013415 (1976)","journal-title":"Acta Informatica"},{"issue":"1-2","key":"39_CR5","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/S0304-3975(01)00171-2","volume":"270","author":"S. Ewert","year":"2002","unstructured":"Ewert, S., van der Walt, A.: A pumping lemma for random permitting context languages. Theoretical Computer Science\u00a0270(1-2), 959\u2013967 (2002)","journal-title":"Theoretical Computer Science"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01694004","volume":"2","author":"W. Ogden","year":"1968","unstructured":"Ogden, W.: A helpful result for proving inherent ambiguity. Mathematical Systems Theory\u00a02, 191\u2013194 (1968)","journal-title":"Mathematical Systems Theory"},{"issue":"3","key":"39_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1051\/ita\/1979130302891","volume":"13","author":"G. P\u0103un","year":"1979","unstructured":"P\u0103un, G.: Some further remarks on the family of finite index matrix languages. RAIRO Informatique Th\u00e9orique\u00a013(3), 289\u2013297 (1979)","journal-title":"RAIRO Informatique Th\u00e9orique"},{"issue":"4","key":"39_CR8","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/0020-0190(76)90004-1","volume":"5","author":"G. Rozenberg","year":"1976","unstructured":"Rozenberg, G.: More on ET0L systems versus random context grammars. Information Processing Letters\u00a05(4), 102\u2013106 (1976)","journal-title":"Information Processing Letters"},{"issue":"1-2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0304-3975(98)00160-1","volume":"237","author":"A. Walt van der","year":"2000","unstructured":"van der Walt, A., Ewert, S.: A shrinking lemma for random forbidding context languages. Theoretical Computer Science\u00a0237(1-2), 149\u2013158 (2000)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:32:34Z","timestamp":1556440354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}