According to our database1, Hing Leung authored at least 25 papers between 1991 and 2009.
Legend:Book In proceedings Article PhD thesis Other
A Technique for Proving Lower Bounds on the Size of Sweeping Automata.
Journal of Automata, Languages and Combinatorics, 2009
Theor. Comput. Sci., 2007
Structurally Unambiguous Finite Automata.
Proceedings of the Implementation and Application of Automata, 2006
Descriptional complexity of nfa of different ambiguity.
Int. J. Found. Comput. Sci., 2005
The limitedness problem on distance automata: Hashiguchi's method revisited.
Theor. Comput. Sci., 2004
On factorization forests of finite height.
Theor. Comput. Sci., 2004
Descriptional Complexity of NFAs of Different Ambiguity.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004
Adaptive Random Testing.
Proceedings of the Advances in Computer Science, 2004
Descriptional Complexity of Machines with Limited Resources.
J. UCS, 2002
Tight Lower Bounds on the Size of Sweeping Automata.
J. Comput. Syst. Sci., 2001
The Limitedness Problem on Distance Automata.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001
On the size of parsers and LR(k)-grammars.
Theor. Comput. Sci., 2000
On a Family of Nondeterministic Finite Automata.
Journal of Automata, Languages and Combinatorics, 2000
Test case selection with and without replacement.
Inf. Sci., 2000
A Revisit of the Proportional Sampling Strategy.
Proceedings of the 12th Australian Software Engineering Conference (ASWEC 2000), 2000
A New Perspective of the Proportional Sampling Strategy.
Comput. J., 1999
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata.
SIAM J. Comput., 1998
Measuring Nondeterminism in Pushdown Automata.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997
A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs.
Inf. Process. Lett., 1995
On the Analysis of Subdomain Testing Strategies.
Proceedings of the 2nd Asia-Pacific Software Engineering Conference (APSEC '95), 1995
Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
On the Relation between Ambiguity and Nondeterminism in Finite Automata
Inf. Comput., October, 1992
A Note on Finitely Ambiguous Distance Automata.
Inf. Process. Lett., 1992
On Finite Automata with Limited Nondeterminism.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof.
Theor. Comput. Sci., 1991