Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof. - Hing Leung (Theor. Comput. Sci., 1991)

A Note on Finitely Ambiguous Distance Automata. - Hing Leung (Inf. Process. Lett., 1992)

On the Relation between Ambiguity and Nondeterminism in Finite Automata - Jonathan Goldstine; Hing Leung; Detlef Wotschke (Inf. Comput., 1992)

Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA. - Hing Leung (ISAAC, 1993)

On the Analysis of Subdomain Testing Strategies. - Tsong Yueh Chen; Hing Leung; Yuen-Tak Yu (APSEC, 1995)

A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs. - Hing Leung; Desh Ranjan; Héctor J. Hernández; D. T. Tang; Agustin González (Inf. Process. Lett., 1995)

On Finite Automata with Limited Nondeterminism. - Hing Leung (Acta Informatica, 1998)

Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata. - Hing Leung (SIAM J. Comput., 1998)

A New Perspective of the Proportional Sampling Strategy. - Hing Leung; Tsong Yueh Chen (Comput. J., 1999)

A Revisit of the Proportional Sampling Strategy. - Hing Leung; Tsong Yueh Chen (Australian Software Engineering Conference, 2000)

Test case selection with and without replacement. - Hing Leung; T. H. Tse; F. T. Chan; Tsong Yueh Chen (Inf. Sci., 2000)

On a Family of Nondeterministic Finite Automata. - Hing Leung (J. Autom. Lang. Comb., 2000)

On the size of parsers and LR(k)-grammars. - Hing Leung; Detlef Wotschke (Theor. Comput. Sci., 2000)

The Limitedness Problem on Distance Automata. - Hing Leung; Viktor Podolskiy (DCFS, 2001)

Tight Lower Bounds on the Size of Sweeping Automata. - Hing Leung (J. Comput. Syst. Sci., 2001)

Descriptional Complexity of Machines with Limited Resources. - Jonathan Goldstine; Martin Kappes; Chandra M. R. Kintala; Hing Leung; Andreas Malcher; Detlef Wotschke (J. Univers. Comput. Sci., 2002)

Adaptive Random Testing. - Tsong Yueh Chen; Hing Leung; I. K. Mak (ASIAN, 2004)

Descriptional Complexity of NFAs of Different Ambiguity. - Hing Leung (DCFS, 2004)

On factorization forests of finite height. - Jérémie Chalopin; Hing Leung (Theor. Comput. Sci., 2004)

The limitedness problem on distance automata: Hashiguchi's method revisited. - Hing Leung; Viktor Podolskiy (Theor. Comput. Sci., 2004)

Descriptional complexity of nfa of different ambiguity. - Hing Leung (Int. J. Found. Comput. Sci., 2005)

Measuring nondeterminism in pushdown automata. - Jonathan Goldstine; Hing Leung; Detlef Wotschke (J. Comput. Syst. Sci., 2005)

Structurally Unambiguous Finite Automata. - Hing Leung (CIAA, 2006)

Preface. - Hing Leung; Giovanni Pighizzini (Theor. Comput. Sci., 2007)

A Technique for Proving Lower Bounds on the Size of Sweeping Automata. - Hing Leung (J. Autom. Lang. Comb., 2009)

A note on extended Euclid's algorithm. - Hing Leung (CoRR, 2016)