{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:35:06Z","timestamp":1767900906932,"version":"3.49.0"},"reference-count":20,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1992]]},"DOI":"10.1051\/ita\/1992260403631","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:09:07Z","timestamp":1486030147000},"page":"363-386","source":"Crossref","is-referenced-by-count":4,"title":["Finitary codes for biinfinite words"],"prefix":"10.1051","volume":"26","author":[{"given":"J.","family":"Devolder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Timmerman","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. BARBIN-LE REST E. and LE REST M., Sur la combinatoire des codes \u00e0 deux mots, Theor. Comp. Sc., 1985, 41, pp. 61-80.8410230593.20066","DOI":"10.1016\/0304-3975(85)90060-X"},{"key":"R2","unstructured":"2. BEAL M. P., Codages, automates locaux et entropie, Th\u00e8se, Publications du L.I.T.P., 38, Universit\u00e9 de Paris-VII, 1988."},{"key":"R3","unstructured":"3. BEAUQUIER D., Automates sur les mots biinfinis, Th\u00e8se d'\u00e9tat, Universit\u00e9 Paris-VII, 1986."},{"key":"R4","unstructured":"4. BERSTEL J. and PERRIN D., Theory of Codes, Academic Press, Orlando, 1985.7970690587.68066"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. BLANCHARD F., Codes engendrant certains syst\u00e8mes sofiques, Theoret. Comput. Sci., 1989, 68, pp. 253-265.10319600683.28009","DOI":"10.1016\/0304-3975(89)90163-1"},{"key":"R6","unstructured":"6. DEVOLDER J., Precircular Codes and Periodic Biinfinite Words, Publications du L.I.F.L., I.T. 175, 1989, Inform. and Comput. (to appear).12516180790.94007"},{"key":"R7","unstructured":"7. DEVOLDER J., LATTEUX M., LITOVSKY I. and STAIGER L., Codes and Infinite Words, Publications du L.I.F.L., I.T. 220, 1991."},{"key":"R8","unstructured":"8. DEVOLDER J. and TIMMERMAN E., Codes for Biinfinite Words, Publications du L.I.F.L., I.T. 194, 1990.0754.68066"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. DO LONG VAN , Codes avec des mots infinis, R.A.I.R.O. Inform. Theor. Appl., 1982, 16, pp. 371-386.921720498.68053","DOI":"10.1051\/ita\/1982160403711"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. DO LONG VAN , THOMAS D. G., SUBRAMANIAN K. G. and SIROMONEY R., Bi-Infinitary Codes, RAIRO Inform. Theor. Appl. , 1990, 24, 1, pp. 67-87.923500701.68061","DOI":"10.1051\/ita\/1990240100671"},{"key":"R11","unstructured":"11. EILENBERG S., Automata, Languages, and Machines, Academic Press, New York, 1974."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. KARHUMAKI J., On Three-Element Codes, Theoret. Comput.Sci., 1985, 40, pp. 3-11.0574.68062","DOI":"10.1016\/0304-3975(85)90100-8"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. LASSEZ J. L., Circular codes and synchronisation, Internat. J. Comput. Syst. Sci., 1976, 5, pp. 201-208.0401.68050","DOI":"10.1007\/BF00975632"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. LECONTE M., K-th Power-Free Codes, Automata on infinite words, Lecture notes in Comput. Sci., 1984, 192, pp. 172-187.0571.68054","DOI":"10.1007\/3-540-15641-0_33"},{"key":"R15","unstructured":"15. LENTIN A. and SCHUTZENBERGER M. P., A Combinatorial Problem in the Theory of Free Monoids, Proc. Univ. of North Carolina, 1967, pp. 128-144.0221.20076"},{"key":"R16","unstructured":"16. LITOVSKY I., G\u00e9n\u00e9rateurs des langages rationnels de mots infinis, Th\u00e8se, Universit\u00e9 de Lille-I, 1988."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. DE LUCA A. and RESTIVO A., On Some Properties of Very Pure Codes, Theoret. Comput. Sci., 1980, pp. 157-170.5516020421.68078","DOI":"10.1016\/0304-3975(80)90012-2"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"18. NIVAT M. and PERRIN D., Ensembles reconnaissables de mots biinfinis, Proc. 14e Symp. on Theory of Computing, 1982, pp.47-59.0589.68056","DOI":"10.1145\/800070.802176"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"19. RESTIVO A., Codes and automata, Lecture notes in Comput. Sci., 1989, 386, pp. 186-198.1051960","DOI":"10.1007\/BFb0013121"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"20. STAIGER L., On Infinitary Finite Length Codes, R.A.I.R.O., Inform. Th\u00e9or. Appl., 1986, 20, 4, pp. 483-494.922738808490628.68056","DOI":"10.1051\/ita\/1986200404831"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260403631\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:59:18Z","timestamp":1568771958000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260403631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"references-count":20,"journal-issue":{"issue":"4"},"alternative-id":["ita1992260403631"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1992260403631","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}