{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:53:41Z","timestamp":1769820821949,"version":"3.49.0"},"reference-count":10,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1983]]},"DOI":"10.1051\/ita\/1983170100131","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:32:46Z","timestamp":1486395166000},"page":"13-22","source":"Crossref","is-referenced-by-count":12,"title":["On the separating power of EOL systems"],"prefix":"10.1051","volume":"17","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. AUTEBERT J. M., BEAUQUIER J., BOASSON L. and NIVAT M., Quelques probl\u00e8mes ouverts en th\u00e9orie des langages alg\u00e9brique, RAIRO Informatique Th\u00e9orique, vol. 13, 1979, p. 363-379.921105569580434.68056","DOI":"10.1051\/ita\/1979130403631"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BERSTEL J., Sur les mots sans carr\u00e9 d\u00e9finis par un morphism, Lecture Notes in Computer Science, Springer-Verlag, vol. 71, 1979, p. 16-25.5732320425.20046","DOI":"10.1007\/3-540-09510-1_2"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. BEAN D. R., EHRENFEUCHT A. and MCNULTY G. F., Avoidable patterns in strings of symbols, Pacific Journal of Mathematics, vol. 85, n\u00b0 2, 1979, p. 261-294.5749190428.05001","DOI":"10.2140\/pjm.1979.85.261"},{"key":"R4","unstructured":"4. EHRENFEUCHT A. and ROZENBERG G., On the subword complexity of square-free DOL languages, Theoretical Computer Science, to appear.6326680481.68073"},{"key":"R5","unstructured":"5. HARRISON M., Introduction to formal language theory, Addison-Wesley, Reading, Massachusetts, 1978.5263970411.68058"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. VAN LEEUWEN J., The tape complexity of context independent developmental languages, Journal of Computer and System Sciences, vol. 11, 1975, p. 203-211.3813970314.68017","DOI":"10.1016\/S0022-0000(75)80068-7"},{"key":"R7","unstructured":"7. ROZENBERG G. and SALOMAA A., The mathematical theory of L System, Academic Press, London, New York, 1980.5617110508.68031"},{"key":"R8","unstructured":"8. SALOMAA A., Morphisms on free monoids and language theory, in Book, R (ed.), Formal language theory: perspectives and open problems, Academic Press, London, New York, to appear."},{"key":"R9","unstructured":"9. SALOMAA A., Jewels of formal language theory, Computer Press, Potomac, Md., to appear.0487.68063618124"},{"key":"R10","unstructured":"10. THUE A., Ueber unendliche Zeichenreihen, Norsk. Vid. Selsk. Skr. I Mat.-Nat. Kl., n\u00b0 7, 1906, p. 1-22.39.0283.01"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1983170100131\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:33:21Z","timestamp":1568799201000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1983170100131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":10,"journal-issue":{"issue":"1"},"alternative-id":["ita1983170100131"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1983170100131","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}