Do Long Van Codes avec des mots infinis. (French) Zbl 0498.68053 RAIRO, Inf. Théor. 16, 371-386 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 Documents MSC: 68T99 Artificial intelligence 20M35 Semigroups in automata theory, linguistics, etc. 94A45 Prefix, length-variable, comma-free codes Keywords:codes with infinite words; prefix-maximal code PDF BibTeX XML Cite \textit{Do Long Van}, RAIRO, Inf. Théor. 16, 371--386 (1982; Zbl 0498.68053) Full Text: EuDML OpenURL References: [1] 1. D. PERRIN, éd., Théorie des codes Actes de la septième Ecole de Printemps d’informatique théorique, Jougne, 1979. Zbl0628.94001 · Zbl 0628.94001 [2] 2. J. BERSTEL, D. PERRIN et M. P. SCHÜTZENBERGER, Théoriedes codes (à paraître). [3] 3. S. EILENBERG, Automata Languages and Machines, vol. A, Academic Press, New York, 1974. Zbl0317.94045 MR530382 · Zbl 0317.94045 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.