{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:16:00Z","timestamp":1649124960932},"reference-count":10,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1984]]},"DOI":"10.1051\/ita\/1984180302791","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:28:57Z","timestamp":1486394937000},"page":"279-295","source":"Crossref","is-referenced-by-count":0,"title":["On ambiguity in DOS systems"],"prefix":"10.1051","volume":"18","author":[{"given":"Andrzej","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Haussler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. EHRENFEUCHT A., HAUSSLER D., ROZENBERG G. and ZEIGER P., On DOS languages and DOS mappings, in preparation.0535.68034"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. EHRENFEUCHT A. and ROZENBERG G., On the Emptiness of the Intersection of Two DOS Languages Problem, Information Processing Letters, Vol. 10, 1980, pp. 223-225.5853870467.68069","DOI":"10.1016\/0020-0190(80)90145-3"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. EHRENFEUCHT A. and ROZENBERG G., On Basic Properties of DOS Systems and Languages, Information and Control, Vol. 47, 1980, pp. 137-153.6137390469.68076","DOI":"10.1016\/S0019-9958(80)90749-4"},{"key":"R4","unstructured":"4. EHRENFEUCHT A. and ROZENBERG G., Representation Theorems Using DOS Languages, Acta Informatica, to appear.0504.68047672103"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. GREIBACH S., The Undecidability of the Ambiguity Problem for Minimal Linear Grammars, Information and Control, Vol. 6, 1963, pp. 119-125.1606750115.37007","DOI":"10.1016\/S0019-9958(63)90149-9"},{"key":"R6","unstructured":"6. HARRISON M., Introduction to Formal Language Theory, Addison-Wesley, 1978.5263970411.68058"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. HARJU T. and PETTONEN M., Some Decidability Problems of Sentential forms, International Journal of Computer Mathematics, Vol.7, 1979, pp. 95-108.5332100405.68061","DOI":"10.1080\/00207167908803161"},{"key":"R8","unstructured":"8. MAURER H. A., SALOMAA A. and WOOD D., Pure Grammars, McMaster University, Computer Science Technical Report No. 79-CS-7, 1979.559988"},{"key":"R9","unstructured":"9. ROZENBERG G. and SALOMAA A., The Mathematical Theory of L Systems, Academic Press, New York-London, 1980.5617110508.68031"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. SALOMAA A., On Sentential Forms of Context Free Grammars, Acta Informatica, Vol. 2, 1973, pp. 40-49.3249620264.68029","DOI":"10.1007\/BF00571462"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180302791\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:32:38Z","timestamp":1568799158000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180302791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":10,"journal-issue":{"issue":"3"},"alternative-id":["ita1984180302791"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1984180302791","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}