Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Do Long Van"'
Autor:
Masami Ito, Do Long Van
This volume presents research results ranging from those in pure mathematical theory (semigroup theory, graph theory, etc.) to those in theoretical and applied computer science, e.g. formal languages, automata, codes, parallel and distributed computi
Autor:
Do Long Van, Ngo Thi Hien
Alternative codes, an extension of the notion of ordinary codes, have been first introduced and considered by P. T. Huy et al. in 2004. As seen below, every alternative code, in its turn, defines an ordinary code. Such codes are called codes induced
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94f0fecbdaa3f82f371e9c5c4fa2cd28
Autor:
Subramanian, K. G.1 kgsmani1948@yahoo.com, Do Long Van2 dlvan@math.ac.vn, Chandra, P. Helen3, Nghiem Do Quyen2
Publikováno v:
Fundamenta Informaticae. 2008, Vol. 83 Issue 4, p411-428. 18p. 3 Diagrams.
Autor:
Phan Trung Huy, Do Long Van
Publikováno v:
Theoretical Computer Science. 98(2):321-337
Perrin (1982) has proved that a part of Buchi-McNaughton theorem in the form formulated by Eilenberg (1974) can be generalized to a large class of varieties of recognizable languages. We show here that Perrin's assertion can be extended to the whole
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d505d4f03144ddfe1127efd45472a257
Publikováno v:
Information Processing Letters. 42:127-132
A notion of ω-rigid sets for a finite monoid is introduced. We prove that a finite monoid M is the Arnold's syntactic monoid of some rational ω-language (ω-syntactic for short) if and only if there exists an ω-rigid set for M . This property is s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21cc38bf4d857cc4877d08d6793f5b0f
https://doi.org/10.1016/0020-0190(92)90135-i
https://doi.org/10.1016/0020-0190(92)90135-i
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 26:565-580
Les zigzag codes sont etudies par le biais des morphismes de monoides et de groupes libres. L'injectivite des morphismes de groupes libres joue ici le role de celle des morphismes de monoides pour les codes. Les calculs decrits dans le groupe libre a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ac604df84d8afbcf9450edf0a396750
https://doi.org/10.1051/ita/1992260605651
https://doi.org/10.1051/ita/1992260605651
Autor:
Do Long Van, Nguyen Huong Lam
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 24:441-458
La notion de codes infinitaires a ete introduite et etudiee. Nous considerons dans cet article une classe speciale de tels codes appeles codes stricts i.e. des codes qui concernent un produit infini de mots
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24d8a81b664169c1f727291ba7444401
https://doi.org/10.1051/ita/1990240504411
https://doi.org/10.1051/ita/1990240504411
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 24:67-87
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01decedd275dd0025417e07d0f01bf7d
https://doi.org/10.1051/ita/1990240100671
https://doi.org/10.1051/ita/1990240100671