{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:59:48Z","timestamp":1768280388825,"version":"3.49.0"},"reference-count":6,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1977]]},"DOI":"10.1051\/ita\/1977110403111","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:34:13Z","timestamp":1486395253000},"page":"311-327","source":"Crossref","is-referenced-by-count":37,"title":["Mots infinis engendr\u00e9s par une grammaire alg\u00e9brique"],"prefix":"10.1051","volume":"11","author":[{"given":"Maurice","family":"Nivat","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. ARNOLD A. et NIVAT M., Non-Deterministic Recursive Program Schemes, \u00e0 paraitre dans Fundamentals of Computation Theory, Lecture Notes in Computer Science, n\u00b0 56, p. 12-21, Springer Verlag, 1977.5021200361.68020","DOI":"10.1007\/978-3-662-40153-8_2"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. CHOUEKA Y., Theories of Automata on \u03c9-Tapes: a Simplified Approach, J. Comp. Syst. Sciences, vol. 8, 1974, p. 117-141.3423780292.02033","DOI":"10.1016\/S0022-0000(74)80051-6"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. COHEN R. et GOLD A., Theory of \u03c9-Languages; Part I: Characterizations of \u03c9-Context-Free Languag\u00e9s, J. Comp. Syst. Sciences, vol. 15, 1977, p. 169-184.4837410363.68113","DOI":"10.1016\/S0022-0000(77)80004-4"},{"key":"R4","unstructured":"4. EILENBERG S., Automata, Languages and Machines, vol. A, Academic Press, New York, 1974.5303820317.94045"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. MCNAUGHTON R., Testing and Generating Infinite Sequences by a Finite Automaton, Inf. and Control, vol. 9, 1966, p. 521-530.2132410212.33902","DOI":"10.1016\/S0019-9958(66)80013-X"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. SCH\u00dcTZENBERGER M. P., Push-Down Automata and Context-Free Languages, Inf. and Control, vol. 6, 1963, p. 246-264.1638090123.12502","DOI":"10.1016\/S0019-9958(63)90306-1"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1977110403111\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:33:37Z","timestamp":1568799217000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1977110403111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":6,"journal-issue":{"issue":"4"},"alternative-id":["ita1977110403111"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1977110403111","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1977]]}}}