On a class of infiinitary codes. - Nguyen Huong Lam; Do Long Van (RAIRO Theor. Informatics Appl., 1990)

On Strict Codes. - Nguyen Huong Lam; Do Long Van (Acta Cybern., 1991)

On Codes of Bi-Infinite Words. - Do Long Van; Nguyen Huong Lam; Phan Trung Huy (Acta Cybern., 1993)

Measure of Infinitary Codes. - Nguyen Huong Lam; Do Long Van (Acta Cybern., 1994)

A Note on Codes Having no Finite Completions. - Nguyen Huong Lam (Inf. Process. Lett., 1995)

On Codes Having no Finite Completion. - Nguyen Huong Lam (RAIRO Theor. Informatics Appl., 1995)

Hajós Factorizations and Completion of Codes. - Nguyen Huong Lam (Theor. Comput. Sci., 1997)

Unavoidable set: extension and reduction. - Phan Trung Huy; Nguyen Huong Lam (RAIRO Theor. Informatics Appl., 1999)

Finite maximal solid codes. - Nguyen Huong Lam (Theor. Comput. Sci., 2001)

Finite Completion of Comma-Free Codes. Part I. - Nguyen Huong Lam (Developments in Language Theory, 2002)

Completing comma-free codes. - Nguyen Huong Lam (Theor. Comput. Sci., 2003)

Finite Completion of comma-free codes. Part 1. - Nguyen Huong Lam (RAIRO Theor. Informatics Appl., 2004)

Finite Completion of comma-free codes. Part 2. - Nguyen Huong Lam (RAIRO Theor. Informatics Appl., 2004)

Asymptotically Optimal Low-Cost Solid Codes. - Helmut Jürgensen; Stavros Konstantinidis; Nguyen Huong Lam (J. Autom. Lang. Comb., 2004)

On a Test of Square-Free Morphisms. - Nguyen Huong Lam (RAIRO Theor. Informatics Appl., 2024)