{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:12:12Z","timestamp":1648685532960},"reference-count":13,"publisher":"EDP Sciences","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1051\/ita:2000132","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T15:09:21Z","timestamp":1068822561000},"page":"585-596","source":"Crossref","is-referenced-by-count":0,"title":["Codes g\u00e9n\u00e9rateurs minimaux de langages de mots bi-infinis"],"prefix":"10.1051","volume":"34","author":[{"given":"Jeanne","family":"Devolder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,4,15]]},"reference":[{"key":"R1","unstructured":"J. Berstel et D. Perrin,Theory of codes. Academic Press, Orlando (1985)."},{"key":"R2","unstructured":"D. Beauquier,Automates sur les mots bi-infinis. Thesis, University of Paris VII, France (1986)."},{"key":"R3","unstructured":"V. Bruy\u00e8re, Codes, Chapter 7,Algebraic Combinatorics on words, edited by M. Lothaire (to appear)."},{"key":"R4","unstructured":"J. Devolder, Comportement des codes vis-\u00e0-vis des mots infinis et bi-infinis.Th\u00e9orie des Automates et Applications, edited by D. Krob. Rouen, France (1991) 75-90."},{"key":"R5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(91)90046-5","volume":"85","author":"Devolder","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"R6","first-page":"363","volume":"26","author":"Devolder","year":"1992","journal-title":"RAIRO: Theoret. Informatics Appl."},{"key":"R7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/inco.1993.1066","volume":"107","author":"Devolder","year":"1993","journal-title":"Inform. and Comput."},{"key":"R8","unstructured":"J. Devolder,Codes, mots infinis et bi-infinis. Ph.D. Thesis, University of Lille I, France (1993)."},{"key":"R9","first-page":"241","volume":"11","author":"Devolder","year":"1994","journal-title":"Acta Cybernet."},{"key":"R10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(91)90022-T","volume":"86","author":"Gire","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"R11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00975632","volume":"5","author":"Lassez","year":"1976","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"R12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(91)90134-4","volume":"37","author":"Litovsky","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"R13","unstructured":"M. Nivat et D. Perrin, Ensembles reconnaissables de mots bi-infinis, inProc. 14e ACM Symp. on Theory of Computing, Vol. 005 (1982) 47-59."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2000132\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T02:13:48Z","timestamp":1497579228000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2000132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":13,"journal-issue":{"issue":"6"},"alternative-id":["ita0108"],"URL":"https:\/\/doi.org\/10.1051\/ita:2000132","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}