{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:34:21Z","timestamp":1767897261428,"version":"3.49.0"},"reference-count":16,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1990]]},"DOI":"10.1051\/ita\/1990240100671","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:38:48Z","timestamp":1486031928000},"page":"67-87","source":"Crossref","is-referenced-by-count":4,"title":["Bi-infinitary codes"],"prefix":"10.1051","volume":"24","author":[{"family":"Do Long Van","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. G.","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. G.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rani","family":"Siromoney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. BERSTEL J. and PERRIN D., Theory of Codes, Academic Press, 1985.7970690587.68066"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BOOK R. V., Thue Systems and Church-Rosser Property: Replacement Systems, Specification of Formal Languages and Presentations of Monoids, in Combinatorics on Words, L. CUMMING Ed., Academic Press, 1983, pp. 1-38.9101270563.68062","DOI":"10.1016\/B978-0-12-198820-3.50007-3"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. LONGVAN DO, Codes avec des mots infinis, R.A.I.R.O. inform. Theor., Vol.16, 1982, pp. 371-386.921727076380498.68053","DOI":"10.1051\/ita\/1982160403711"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. LONG VAN DO, Sous-mono\u00efdes et codes avec des mots infinis, Semigroup Forum, Vol. 26, 1983, pp. 75-87.1345936851170504.68054","DOI":"10.1007\/BF02572821"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. LONG VAN DO, Ensembles code - Compatibles et une g\u00e9n\u00e9ralisation du th\u00e9or\u00e8me de Sardinas\/Patterson, Theor. Comp. Science, Vol. 38, 1985, pp. 123-132.8051380574.20053","DOI":"10.1016\/0304-3975(85)90214-2"},{"key":"R6","unstructured":"6. LONG VAN DO, Sur les ensembles g\u00e9n\u00e9rateurs minimaux des sous-mono\u00efdes de A\u221e, C. R. Acad. Sci. Paris, 300, S\u00e9rie I, 1985, pp. 443-446.7940190578.68063"},{"key":"R7","unstructured":"7. LONG VAN DO, Caract\u00e9risations combinatoires des sous-mono\u00efdes engendr\u00e9s par un code infinitaire, Hanoi Preprint S\u00e9ries, No. 6, 1984."},{"key":"R8","unstructured":"8. LONG VAN DO, Languages \u00e9crits par un code infinitaire, Th\u00e9or\u00e8me du d\u00e9faut, Acta Cybernetica, Vol. 7, 1986, pp. 247-257.8293050611.68046"},{"key":"R9","unstructured":"9. LONG VAN DO, Codes infinitaires et automates non-ambigus, C. R. Acad. Sci. Paris, T. 302, S\u00e9ries I, 1986, pp. 693-696.8477560602.68069"},{"key":"R10","unstructured":"10. LONG VAN DO, Contribution to Combinatorics on Words, Publication of L.I.T.P., No. 29, 1985."},{"key":"R11","unstructured":"11. EILENBERG S., Automata, Languages and Machines, Vol. A, Academic Press, New York\/London, 1974.5303820317.94045"},{"key":"R12","unstructured":"12. LALLEMENT G., Semigroups and Combinatorial Application, Wiley, New York, 1979.5305520421.20025"},{"key":"R13","unstructured":"13. NIVAT M., \u00c9l\u00e9ments de la th\u00e9orie g\u00e9n\u00e9rale des codes, in Automata Theory, CAIANIELLO E. R. (Ed.) Academic Press, New York\/London, 1966, pp. 278-294.2411680208.45101"},{"key":"R14","unstructured":"14. NIVAT M. and ARNOLD A., Comportements de processus, in Colloque, Les Math\u00e9matiques de l'Informatique, Paris, 1982, pp. 35-68.0538.68062"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. NIVAT M. and PERRIN D., Ensembles reconnaissables de mots biinfinis, Canad. J. Math., Vol. XXXVIII, No. 3, 1986, pp. 513-537.8456620619.68067","DOI":"10.4153\/CJM-1986-025-6"},{"key":"R16","unstructured":"16. SCH\u00dcTZENBERGER M. P., Une th\u00e9orie alg\u00e9brique du codage, S\u00e9minaire Dubrail, expose No. 15, Algebre et th\u00e9orie des nombres, ann\u00e9e 1955-1956.11109475169"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1990240100671\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T02:04:52Z","timestamp":1568772292000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1990240100671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"references-count":16,"journal-issue":{"issue":"1"},"alternative-id":["ita1990240100671"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1990240100671","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}