{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:49:51Z","timestamp":1648763391674},"reference-count":7,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1978]]},"DOI":"10.1051\/ita\/1978120302011","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:39:15Z","timestamp":1486395555000},"page":"201-202","source":"Crossref","is-referenced-by-count":7,"title":["On languages satisfying Ogden's lemma"],"prefix":"10.1051","volume":"12","author":[{"given":"L.","family":"Boasson","sequence":"first","affiliation":[]},{"given":"S.","family":"Horv\u00e1th","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. AUTEBERT J. M., BOASSON L. and COUSINEAU G., A Note on 1-Locally Linear Language, Information and Control, Vol. 37, No. 1, 1978, p. 1-4.4837320377.68045","DOI":"10.1016\/S0019-9958(78)90365-0"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BAR-HILLE Y., PERLES M. and SHAMIR E., On Formal Proper des of Simple Phrase Structure Grammars, Zeitschr. Phonetik., Sprachwiss., Vol. 14, 1961, p. 143-172.1513760106.34501","DOI":"10.1524\/stuf.1961.14.14.143"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. OGDEN W., A Helpful Resuit for Proving Inherent Ambiguity, Math. System Theory, Vol. 2, No. 3, 1968, p. 191-194.2336450175.27802","DOI":"10.1007\/BF01694004"},{"key":"R4","unstructured":"4. AHO A. V. and ULLMAN J. D., The Theory of Parsing, Translationand Compiling, Vol. I Parsing, Prentice-Hall, 1971.0217.53803408321"},{"key":"R5","unstructured":"5. SALOMAA A., Formal Language, Academic Press, New York, London, 1973.438755"},{"key":"R6","unstructured":"6. HORV\u00c1TH S., The Family of Languages Satisfying Bar-Hillel's Lemma, this issue of the R.A.I.R.O., Informatique th\u00e9orique.920750387.68053"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. WISE D., A Strong Pumping Lemma for Context-Free Languages, Theoretical Computer Science, Vol. 3 1976, p. 359-369.4647540359.68091","DOI":"10.1016\/0304-3975(76)90052-9"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1978120302011\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:34:59Z","timestamp":1568799299000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1978120302011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":7,"journal-issue":{"issue":"3"},"alternative-id":["ita1978120302011"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1978120302011","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}