Hing Leung - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2009

A Technique for Proving Lower Bounds on the Size of Sweeping AutomataHing Leung. jalc, 14(1):93-105, 2009.

2007

PrefaceHing Leung, Giovanni Pighizzini. TCS, 387(2):91-92, 2007. [doi]

2006

Structurally Unambiguous Finite AutomataHing Leung. wia 2006: 198-207 [doi]

2005

Measuring nondeterminism in pushdown automataJonathan Goldstine, Hing Leung, Detlef Wotschke. jcss, 71(4):440-466, 2005. [doi]

Descriptional complexity of nfa of different ambiguityHing Leung. ijfcs, 16(5):975-984, 2005. [doi]

2004

On factorization forests of finite heightJérémie Chalopin, Hing Leung. TCS, 310(1-3):489-499, 2004. [doi]

Adaptive Random TestingTsong Yueh Chen, Hing Leung, I. K. Mak. asian 2004: 320-329 [doi]

The limitedness problem on distance automata: Hashiguchi s method revisitedHing Leung, Viktor Podolskiy. TCS, 310(1-3):147-158, 2004. [doi]

Descriptional Complexity of NFAs of Different AmbiguityHing Leung. dcfs 2004: 98-107

2002

Descriptional Complexity of Machines with Limited ResourcesJonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke. jucs, 8(2):193-234, 2002. [doi]

2001

Tight Lower Bounds on the Size of Sweeping AutomataHing Leung. jcss, 63(3):384-393, 2001. [doi]

The Limitedness Problem on Distance AutomataHing Leung, Viktor Podolskiy. dcfs 2001: 115-121

2000

On a Family of Nondeterministic Finite AutomataHing Leung. jalc, 5(3):235-244, 2000.

On the size of parsers and LR(k)-grammarsHing Leung, Detlef Wotschke. TCS, 242(1-2):59-69, 2000. [doi]

A Revisit of the Proportional Sampling StrategyHing Leung, Tsong Yueh Chen. ASWEC 2000: 247-254 [doi]

Test case selection with and without replacementHing Leung, T. H. Tse, F. T. Chan, Tsong Yueh Chen. isci, 129(1-4):81-103, 2000.

1999

A New Perspective of the Proportional Sampling StrategyHing Leung, Tsong Yueh Chen. cj, 42(8):693-698, 1999.

1998

On Finite Automata with Limited NondeterminismHing Leung. ACTA, 35(7):595-624, 1998. [doi]

Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite AutomataHing Leung. SICOMP, 27(4):1073-1082, 1998. [doi]

1997

Measuring Nondeterminism in Pushdown AutomataJonathan Goldstine, Hing Leung, Detlef Wotschke. STACS 1997: 295-306

1995

On the Analysis of Subdomain Testing StrategiesTsong Yueh Chen, Hing Leung, Yuen-Tak Yu. apsec 1995: 218-224 [doi]

A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog ProgramsHing Leung, Desh Ranjan, Héctor J. Hernández, D. T. Tang, Agustin González. ipl, 55(5):279-282, 1995. [doi]

1993

Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFAHing Leung. isaac 1993: 221-229

1992

On the Relation between Ambiguity and Nondeterminism in Finite AutomataJonathan Goldstine, Hing Leung, Detlef Wotschke. iandc, 100(2):261-270, October 1992.

A Note on Finitely Ambiguous Distance AutomataHing Leung. ipl, 44(6):329-331, 1992.

On Finite Automata with Limited NondeterminismHing Leung. mfcs 1992: 355-363

1991

Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic ProofHing Leung. TCS, 81(1):137-145, 1991.

Sign in or sign up to see more results.

runs on WebDSL