Hing Leung

29 papers A 1B 2C 2Journal 19Unranked 4
YearRankTypeTitle / Venue / Authors
2016 J jnl
A note on extended Euclid's algorithm.
CoRR
Hing Leung
2009 J jnl
A Technique for Proving Lower Bounds on the Size of Sweeping Automata.
J. Autom. Lang. Comb.
Hing Leung
2007 J jnl
Preface.
Theor. Comput. Sci.
Hing Leung, Giovanni Pighizzini
2006 — ed.
8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings
DCFS
Hing Leung, Giovanni Pighizzini
2006 C conf
Structurally Unambiguous Finite Automata.
CIAA
Hing Leung
2005 J jnl
Descriptional complexity of nfa of different ambiguity.
Int. J. Found. Comput. Sci.
Hing Leung
2005 J jnl
Measuring nondeterminism in pushdown automata.
J. Comput. Syst. Sci.
Jonathan Goldstine, Hing Leung, Detlef Wotschke
2004 — conf
Adaptive Random Testing.
ASIAN
Tsong Yueh Chen, Hing Leung, I. K. Mak
2004 — conf
Descriptional Complexity of NFAs of Different Ambiguity.
DCFS
Hing Leung
2004 J jnl
On factorization forests of finite height.
Theor. Comput. Sci.
Jérémie Chalopin, Hing Leung
2004 J jnl
The limitedness problem on distance automata: Hashiguchi's method revisited.
Theor. Comput. Sci.
Hing Leung, Viktor Podolskiy
2002 J jnl
Descriptional Complexity of Machines with Limited Resources.
J. Univers. Comput. Sci.
Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke
2001 — conf
The Limitedness Problem on Distance Automata.
DCFS
Hing Leung, Viktor Podolskiy
2001 J jnl
Tight Lower Bounds on the Size of Sweeping Automata.
J. Comput. Syst. Sci.
Hing Leung
2000 — conf
A Revisit of the Proportional Sampling Strategy.
Australian Software Engineering Conference
Hing Leung, Tsong Yueh Chen
2000 J jnl
On a Family of Nondeterministic Finite Automata.
J. Autom. Lang. Comb.
Hing Leung
2000 J jnl
On the size of parsers and LR(k)-grammars.
Theor. Comput. Sci.
Hing Leung, Detlef Wotschke
2000 J jnl
Test case selection with and without replacement.
Inf. Sci.
Hing Leung, T. H. Tse, F. T. Chan, Tsong Yueh Chen
1999 J jnl
A New Perspective of the Proportional Sampling Strategy.
Comput. J.
Hing Leung, Tsong Yueh Chen
1998 J jnl
On Finite Automata with Limited Nondeterminism.
Acta Informatica
Hing Leung
1998 J jnl
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata.
SIAM J. Comput.
Hing Leung
1997 A conf
Measuring Nondeterminism in Pushdown Automata.
STACS
Jonathan Goldstine, Hing Leung, Detlef Wotschke
1995 J jnl
A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs.
Inf. Process. Lett.
Hing Leung, Desh Ranjan, Héctor J. Hernández, D. T. Tang, Agustin González
1995 C conf
On the Analysis of Subdomain Testing Strategies.
APSEC
Tsong Yueh Chen, Hing Leung, Yuen-Tak Yu
1993 B conf
Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA.
ISAAC
Hing Leung
1992 J jnl
A Note on Finitely Ambiguous Distance Automata.
Inf. Process. Lett.
Hing Leung
1992 B conf
On Finite Automata with Limited Nondeterminism.
MFCS
Hing Leung
1992 J jnl
On the Relation between Ambiguity and Nondeterminism in Finite Automata
Inf. Comput.
Jonathan Goldstine, Hing Leung, Detlef Wotschke
1991 J jnl
Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof.
Theor. Comput. Sci.
Hing Leung