Nguyen Huong Lam

According to our database, Nguyen Huong Lam authored at least 15 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

On a Test of Square-Free Morphisms.

Nguyen Huong Lam

RAIRO Theor. Informatics Appl., 2024

2004

Asymptotically Optimal Low-Cost Solid Codes.

Helmut Jürgensen, Stavros Konstantinidis, Nguyen Huong Lam

J. Autom. Lang. Comb., 2004

Finite Completion of comma-free codes. Part 2.

Nguyen Huong Lam

RAIRO Theor. Informatics Appl., 2004

Finite Completion of comma-free codes. Part 1.

Nguyen Huong Lam

RAIRO Theor. Informatics Appl., 2004

2003

Completing comma-free codes.

Nguyen Huong Lam

Theor. Comput. Sci., 2003

2002

Finite Completion of Comma-Free Codes. Part I.

Nguyen Huong Lam

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001

Finite maximal solid codes.

Nguyen Huong Lam

Theor. Comput. Sci., 2001

1999

Unavoidable set: extension and reduction.

Phan Trung Huy, Nguyen Huong Lam

RAIRO Theor. Informatics Appl., 1999

1997

Hajós Factorizations and Completion of Codes.

Nguyen Huong Lam

Theor. Comput. Sci., 1997

1995

A Note on Codes Having no Finite Completions.

Nguyen Huong Lam

Inf. Process. Lett., 1995

1994

Measure of Infinitary Codes.

Nguyen Huong Lam, Do Long Van

Acta Cybern., 1994

On Codes Having no Finite Completion.

Nguyen Huong Lam

Proceedings of the STACS 94, 1994

1993

On Codes of Bi-Infinite Words.

Do Long Van, Nguyen Huong Lam, Phan Trung Huy

Acta Cybern., 1993

1991

On Strict Codes.

Nguyen Huong Lam, Do Long Van

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990

On a class of infiinitary codes.

Nguyen Huong Lam, Do Long Van

RAIRO Theor. Informatics Appl., 1990