| 2007 |
|---|
| 24 | EE | Hing Leung,
Giovanni Pighizzini:
Preface.
Theor. Comput. Sci. 387(2): 91-92 (2007) |
| 2006 |
|---|
| 23 | EE | Hing Leung:
Structurally Unambiguous Finite Automata.
CIAA 2006: 198-207 |
| 2005 |
|---|
| 22 | EE | Hing Leung:
Descriptional complexity of nfa of different ambiguity.
Int. J. Found. Comput. Sci. 16(5): 975-984 (2005) |
| 21 | EE | Jonathan Goldstine,
Hing Leung,
Detlef Wotschke:
Measuring nondeterminism in pushdown automata.
J. Comput. Syst. Sci. 71(4): 440-466 (2005) |
| 2004 |
|---|
| 20 | EE | Tsong Yueh Chen,
Hing Leung,
I. K. Mak:
Adaptive Random Testing.
ASIAN 2004: 320-329 |
| 19 | EE | Hing Leung,
Viktor Podolskiy:
The limitedness problem on distance automata: Hashiguchi's method revisited.
Theor. Comput. Sci. 310(1-3): 147-158 (2004) |
| 18 | EE | Jérémie Chalopin,
Hing Leung:
On factorization forests of finite height.
Theor. Comput. Sci. 310(1-3): 489-499 (2004) |
| 2002 |
|---|
| 17 | EE | Jonathan Goldstine,
Martin Kappes,
Chandra M. R. Kintala,
Hing Leung,
Andreas Malcher,
Detlef Wotschke:
Descriptional Complexity of Machines with Limited Resources.
J. UCS 8(2): 193-234 (2002) |
| 2001 |
|---|
| 16 | EE | Hing Leung:
Tight Lower Bounds on the Size of Sweeping Automata.
J. Comput. Syst. Sci. 63(3): 384-393 (2001) |
| 2000 |
|---|
| 15 | EE | Hing Leung,
Tsong Yueh Chen:
A Revisit of the Proportional Sampling Strategy.
Australian Software Engineering Conference 2000: 247-254 |
| 14 | | Hing Leung,
T. H. Tse,
F. T. Chan,
Tsong Yueh Chen:
Test case selection with and without replacement.
Inf. Sci. 129(1-4): 81-103 (2000) |
| 13 | | Hing Leung:
On a Family of Nondeterministic Finite Automata.
Journal of Automata, Languages and Combinatorics 5(3): 235-244 (2000) |
| 12 | EE | Hing Leung,
Detlef Wotschke:
On the size of parsers and LR(k)-grammars.
Theor. Comput. Sci. 242(1-2): 59-69 (2000) |
| 1999 |
|---|
| 11 | | Hing Leung,
Tsong Yueh Chen:
A New Perspective of the Proportional Sampling Strategy.
Comput. J. 42(8): 693-698 (1999) |
| 1998 |
|---|
| 10 | EE | Hing Leung:
On Finite Automata with Limited Nondeterminism.
Acta Inf. 35(7): 595-624 (1998) |
| 9 | EE | Hing Leung:
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata.
SIAM J. Comput. 27(4): 1073-1082 (1998) |
| 1997 |
|---|
| 8 | | Jonathan Goldstine,
Hing Leung,
Detlef Wotschke:
Measuring Nondeterminism in Pushdown Automata.
STACS 1997: 295-306 |
| 1995 |
|---|
| 7 | EE | Tsong Yueh Chen,
Hing Leung,
Yuen-Tak Yu:
On the Analysis of Subdomain Testing Strategies.
APSEC 1995: 218-224 |
| 6 | EE | Hing Leung,
Desh Ranjan,
Héctor J. Hernández,
D. T. Tang,
Agustin González:
A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs.
Inf. Process. Lett. 55(5): 279-282 (1995) |
| 1993 |
|---|
| 5 | | Hing Leung:
Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA.
ISAAC 1993: 221-229 |
| 1992 |
|---|
| 4 | | Hing Leung:
On Finite Automata with Limited Nondeterminism.
MFCS 1992: 355-363 |
| 3 | | Jonathan Goldstine,
Hing Leung,
Detlef Wotschke:
On the Relation between Ambiguity and Nondeterminism in Finite Automata
Inf. Comput. 100(2): 261-270 (1992) |
| 2 | | Hing Leung:
A Note on Finitely Ambiguous Distance Automata.
Inf. Process. Lett. 44(6): 329-331 (1992) |
| 1991 |
|---|
| 1 | | Hing Leung:
Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof.
Theor. Comput. Sci. 81(1): 137-145 (1991) |
