Hing Leung

Publication Activity (10 Years)

Years Active: 1991-2016
Publications (10 Years): 1

Top Topics

Experimental Evaluation

Improved Algorithm

Top Venues

Publications

Hing Leung
A note on extended Euclid's algorithm. CoRR (2016)
Hing Leung
A Technique for Proving Lower Bounds on the Size of Sweeping Automata. J. Autom. Lang. Comb. 14 (1) (2009)
Hing Leung, Giovanni Pighizzini
Preface. Theor. Comput. Sci. 387 (2) (2007)
Hing Leung
Structurally Unambiguous Finite Automata. CIAA (2006)
Hing Leung
Descriptional complexity of nfa of different ambiguity. Int. J. Found. Comput. Sci. 16 (5) (2005)
Jonathan Goldstine, Hing Leung, Detlef Wotschke
Measuring nondeterminism in pushdown automata. J. Comput. Syst. Sci. 71 (4) (2005)
Tsong Yueh Chen, Hing Leung, I. K. Mak
Adaptive Random Testing. ASIAN (2004)
Hing Leung
Descriptional Complexity of NFAs of Different Ambiguity. DCFS (2004)
Hing Leung, Viktor Podolskiy
The limitedness problem on distance automata: Hashiguchi's method revisited. Theor. Comput. Sci. 310 (1-3) (2004)
Jérémie Chalopin, Hing Leung
On factorization forests of finite height. Theor. Comput. Sci. 310 (1-3) (2004)
Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke
Descriptional Complexity of Machines with Limited Resources. J. Univers. Comput. Sci. 8 (2) (2002)
Hing Leung
Tight Lower Bounds on the Size of Sweeping Automata. J. Comput. Syst. Sci. 63 (3) (2001)
Hing Leung, Viktor Podolskiy
The Limitedness Problem on Distance Automata. DCFS (2001)
Hing Leung, Detlef Wotschke
On the size of parsers and LR(k)-grammars. Theor. Comput. Sci. 242 (1-2) (2000)
Hing Leung, T. H. Tse, F. T. Chan, Tsong Yueh Chen
Test case selection with and without replacement. Inf. Sci. 129 (1-4) (2000)
Hing Leung, Tsong Yueh Chen
A Revisit of the Proportional Sampling Strategy. Australian Software Engineering Conference (2000)
Hing Leung
On a Family of Nondeterministic Finite Automata. J. Autom. Lang. Comb. 5 (3) (2000)
Hing Leung, Tsong Yueh Chen
A New Perspective of the Proportional Sampling Strategy. Comput. J. 42 (8) (1999)
Hing Leung
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata. SIAM J. Comput. 27 (4) (1998)
Hing Leung
On Finite Automata with Limited Nondeterminism. Acta Informatica 35 (7) (1998)
Jonathan Goldstine, Hing Leung, Detlef Wotschke
Measuring Nondeterminism in Pushdown Automata. STACS (1997)
Tsong Yueh Chen, Hing Leung, Yuen-Tak Yu
On the Analysis of Subdomain Testing Strategies. APSEC (1995)
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) (1995)
Hing Leung
Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA. ISAAC (1993)
Jonathan Goldstine, Hing Leung, Detlef Wotschke
On the Relation between Ambiguity and Nondeterminism in Finite Automata Inf. Comput. 100 (2) (1992)
Hing Leung
On Finite Automata with Limited Nondeterminism. MFCS (1992)
Hing Leung
A Note on Finitely Ambiguous Distance Automata. Inf. Process. Lett. 44 (6) (1992)
Hing Leung
Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof. Theor. Comput. Sci. 81 (1) (1991)