Codes avec des mots infinis
RAIRO. Inform. théor., 16 4 (1982) 371-386
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Handbook of Formal Languages
Helmut Jürgensen and Stavros KonstantinidisHandbook of Formal Languages 511 (1997)
https://doi.org/10.1007/978-3-642-59136-5_8
Finitary codes for biinfinite words
J. Devolder and E. TimmermanRAIRO - Theoretical Informatics and Applications 26 (4) 363 (1992)
https://doi.org/10.1051/ita/1992260403631
On a class of infinitary codes
Nguyen Huong Lâm and Do Long VanRAIRO - Theoretical Informatics and Applications 24 (5) 441 (1990)
https://doi.org/10.1051/ita/1990240504411
Bi-infinitary codes
Do Long Van, D. G. Thomas, K. G. Subramanian and Rani SiromoneyRAIRO - Theoretical Informatics and Applications 24 (1) 67 (1990)
https://doi.org/10.1051/ita/1990240100671
Foundations of Software Technology and Theoretical Computer Science
K. G. Subramanian, Do Long and Rani SiromoneyLecture Notes in Computer Science, Foundations of Software Technology and Theoretical Computer Science 287 3 (1987)
https://doi.org/10.1007/3-540-18625-5_38
On infinitary finite length codes
Ludwig StaigerRAIRO - Theoretical Informatics and Applications 20 (4) 483 (1986)
https://doi.org/10.1051/ita/1986200404831
Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
Do Long VanTheoretical Computer Science 38 123 (1985)
https://doi.org/10.1016/0304-3975(85)90214-2