( en | de | ru )

 

Disambiguation of "Leung, Hing"

Author of the publication

copydeleteadd this publication to your clipboard
Adaptive Random Testing.

, , and . ASIAN, volume 3321 of Lecture Notes in Computer Science, page 320-329. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Raymond Leung

Po Leung

Joseph Manwey Leung

Ho-Kang Leung

Maggi Wai-Han Leung

 

Other publications of authors with the same name

On a Family of Nondeterministic Finite Automata.. Journal of Automata, Languages and Combinatorics, 5 (3): 235-244 (2000)A Revisit of the Proportional Sampling Strategy., and . Australian Software Engineering Conference, page 247-254. IEEE Computer Society, (2000)Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA.. ISAAC, volume 762 of Lecture Notes in Computer Science, page 221-229. Springer, (1993)Descriptional complexity of nfa of different ambiguity.. Int. J. Found. Comput. Sci., 16 (5): 975-984 (2005)On Finite Automata with Limited Nondeterminism.. MFCS, volume 629 of Lecture Notes in Computer Science, page 355-363. Springer, (1992)Measuring Nondeterminism in Pushdown Automata., , and . STACS, volume 1200 of Lecture Notes in Computer Science, page 295-306. Springer, (1997)Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata.. SIAM J. Comput., 27 (4): 1073-1082 (1998)On the size of parsers and LR(k)-grammars., and . Theor. Comput. Sci., 242 (1-2): 59-69 (2000)Tight Lower Bounds on the Size of Sweeping Automata.. J. Comput. Syst. Sci., 63 (3): 384-393 (2001)On the Relation between Ambiguity and Nondeterminism in Finite Automata, , and . Inf. Comput., 100 (2): 261-270 (October 1992)