![]() |
| * | 1982 | |
|---|---|---|
| 4 | Thiet-Dung Huynh: Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma_2^P-Complete FOCS 1982: 21-31 | |
| 3 | Thiet-Dung Huynh: Remarks on the Complexity of an Invariant of Context-Free Grammars. Acta Inf. 17: 89-99 (1982) | |
| 2 | Thiet-Dung Huynh: The Complexity of Semilinear Sets. Elektronische Informationsverarbeitung und Kybernetik 18(6): 291-338 (1982) | |
| 1980 | ||
| 1 | EE | Thiet-Dung Huynh: The Complexity of Semilinear Sets. ICALP 1980: 324-337 |