{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T13:41:57Z","timestamp":1771854117397,"version":"3.50.1"},"reference-count":10,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1986]]},"DOI":"10.1051\/ita\/1986200100891","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:18:51Z","timestamp":1486030731000},"page":"89-96","source":"Crossref","is-referenced-by-count":45,"title":["Each regular code is included in a maximal regular code"],"prefix":"10.1051","volume":"20","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","unstructured":"[BPS] BERSTEL J., PERRIN D. and SCHUTZENBERGER M. P., The Theory of Codes(to appear)."},{"key":"R2","unstructured":"[E] EILENBERG S., Automata, Languages and Machines, Vol. A, 1974, Academic Press, New York and London.5303820317.94045"},{"key":"R3","unstructured":"[F] FELLER W., An Introduction to Probability Theory and its Applications, Vol. 1, 1950, J. Wiley.385830039.13201"},{"key":"R4","unstructured":"[P1] D. Ed.PERRIN, Theorie des codes, L.I.T.P. Publication, Paris, 1979.0628.94001"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"[P2] PERRIN D., Completing Biprefix Codes, Lecture Notes in Computer Science, Vol. 140, 1982, pp. 397-406.6754740485.68075","DOI":"10.1007\/BFb0012786"},{"key":"R6","unstructured":"[P3] PERRIN D., S\u00e9ries formelles et combinatoire du monoide libre, in J. Berstel Ed., Series Formelles, L.I.T.P., Paris, 1977."},{"key":"R7","unstructured":"[R] RESTIVO A., On Codes Having no Finite Completions, in Automata, Languages and Programming, S. MICHAELSON Ed., Edinburgh University Press, 1976, pp. 38-44.498922"},{"key":"R8","unstructured":"[S] SALOMAA A., Formal Languages, Academic Press, London, New York, 1973.4387550262.68025"},{"key":"R9","unstructured":"[Sch] SCHUTZENBERGER M. P., Une th\u00e9orie alg\u00e9brique du codage, Seminaire Dubreuil-Pisot, ann\u00e9e 55-56, exp. No. 15, Inst. Henri-Poincar\u00e9, Paris, 1956.75169"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"[SM] SCHUTZENBERGER M. P. and MARCUS R. S., Full Decodable Code Word Sets, I.R.E. Trans on Inf. Theroy, Vol. 5, 1959, pp. 13-15.130045","DOI":"10.1109\/TIT.1959.1057477"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1986200100891\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T02:02:01Z","timestamp":1568772121000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1986200100891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":10,"journal-issue":{"issue":"1"},"alternative-id":["ita1986200100891"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1986200100891","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]}}}