Đỗ Long Vân

Các công bố khoa học

Ấn phẩm

1. 1. K. Subramanian, P. H. Chandra, Đỗ Long Vân, Nghiem Do Quyen, Array grammars with contextual operations, Fundamenta Informaticae,. 83 (2008), N0 4, 411 - 428. (2008)
2. 2. Phan Trung Huy, Nguyen Quy Khang, Đỗ Long Vân, Finite semigroups with infinite product and languages of infinite words, Vietnam Journal of Mathematics, 35 (2007), 495 - 505. (2007)
3. 3. Kieu Van Hung, Đỗ Long Vân, Prime decomposition problem for several kinds of regular codes, In: Theoretical aspects of computing - ICTAC 2006, 213 - 227, Lecture Notes in Comput. Sci., 4281, Springer, Berlin, 2006. (2006)
4. 4. Đỗ Long Vân, Kieu Van Hung, An approach to the embedding problem for codes defined by binary relations, In: Proceedings of the 1st International Conference on Algebraic Informatics, 111 - 127, Aristotle Univ. Thessaloniki, Thessaloniki, 2005 (2005)
5. 5. Đỗ Long Vân, Kieu Van Hung, Phan Trung Huy, Codes and length-increasing transitive binary relations, In: Theoretical aspects of computing-ICTAC 2005, 29 - 48, Lecture Notes in Comput. Sci., 3722, Springer, Berlin, 2005. (2005)
6. 6. Kieu Van Hung, Phan Trung Huy, Đỗ Long Vân, On some classes of codes defined by binary relations,, Acta Mathematica Vietnamica, 29 (2004), 163 - 176. (2004)
7. 7. Kieu Van Hung, Phan Trung Huy, Đỗ Long Vân, Codes concerning roots of words, Vietnam Journal of Mathematics, 32 (2004), 345 - 359. (2004)
8. 8. Đỗ Long Vân, On a class of hypercodes, In: Words, languages & combinatorics, III (Kyoto, 2000), 171 - 182, World Sci. Publishing, River Edge, NJ, 2003. (2003)
9. 9. Igor Litovsky, Đỗ Long Vân, On a family of codes with bounded deciphering delay, Developments in Language Theory, Lecture Notes in Computer Science, 2450 (2003), 369 - 380. (2003)
10. 10. Phan Trung Huy, Đỗ Long Vân, On non-ambiguous Buchi V-automata, . In : Proceedings of the Third Asian Mathematical Conference, 2000 (Diliman), 224 - 233, World Sci. Publishing, River Edge, NJ, 2002 (2002)
11. 11. Đỗ Long Vân, P. J. Abisha, K. Subramanian, D. G. Thomas, Array codes and crypto-systems, In: Proceedings of the sixth International Workshop on Parallel Image Processing and Analysis, Madras, 1999, 291 - 302. (1999)
12. 12. Nguyễn Hương Lâm, Đỗ Long Vân, Measure of infinitary codes, Acta Cybernetica, 11 (1994), 127 - 137. (1994)
13. 13. Đỗ Long Vân, Problème des mots et de conjugaison pour une classe de groupes de présentation finie, C. R. Acad. Sci. Paris, Série I 292 (1981),773 - 776 (1981)
14. 14. Đỗ Long Vân, N. Q. Toan, Nilpotent quasimodules, Tap chi Toan hoc 6 (1978), 7 - 14 (1978)
15. 15. Đỗ Long Vân, N. Q. Toan, Quasimodules with unique root, Tap chi Toan hoc 6 (1978), 16 - 21 (1978)
16. 16. Đỗ Long Vân, N. Q. Toan, Quasimodules I, Kozl. 21 (1978), 73 - 84 (1978)
17. 17. Đỗ Long Vân, N. Q. Toan, Quasimodules II, Kozl. 21 (1978), 86 - 100 (1978)
18. 18. Đỗ Long Vân, On the word and conjugacy problems for some classes of finitely presented groupsDokl. Akad. Nauk SSSR 241 (1978), 1005 - 1008. English Transl.: Soviet Math. Dokl. 19 (1978), 938 - 941, Dokl. Akad. Nauk SSSR 241 (1978), 1005 - 1008. English Transl.: Soviet Math. Dokl. 19 (1978), 938 - 941 (1978)
19. 19. Đỗ Long Vân, V. D. Man, Bemerkungen zu einer Klasse von durch eindimensionale iterative Automaten akzeptierten Sprachen, Elektron. Inf. Kybern. 149 (1978), 507 - 517 (1977)
20. 20. Đỗ Long Vân, V. D. Man, Quasimodules, Tap chi Toan hoc 5 (1977), 28 - 33 (1977)
21. 21. Đỗ Long Vân, V. D. Man, Several kinds of subquasimodules, Tap chi Toan hoc 5 (1977), 16 - 26 (1977)
22. 22. Đỗ Long Vân, Phan Đình Diệu, Pushdown automata with many pushdown store-tapes, Acta Math. Vietnam. 1 (1976), 47 - 68 (1976)
23. 23. Đỗ Long Vân, Phan Đình Diệu, On the languages recognizable by one-dimensional iterative arrays of finite automata, Elektron. Inf. Kybern. 10 (1974), 271 - 285 (1974)