Thiet-Dung Huynh

The Complexity of Semilinear Sets

Thiet-Dung Huynh, 1982, J. Inf. Process. Cybern..

Remarks on the complexity of an invariant of context-free grammars

Thiet-Dung Huynh, 2004, Acta Informatica.

Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is S2p-complete

Thiet-Dung Huynh, Thiet-Dung Huynh, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).