Hing  Leung
Professor Ph.D., Pennsylvania State University   1987 Email: hleung@cs.nmsu.edu   Phone: (575) 646-1038 Office: SH 160 Home Page
Hing Leung received his B.Sc. in Applied Mathematics from the University of Hong Kong and Ph.D. in Computer Science from the Pennsylvania State University. He was an Alexander von Humboldt research fellow carrying out research at the J.W. Goethe University in Frankfurt, Germany, between 1991 and 1993. Hing has been a faculty member of the computer science department of NMSU since 1987. His research interests are automata and formal languages.

Publications
J. Goldstine, M. Kappes, C.M.R. Kintala, H. Leung,, " Descriptional Complexity of Machines with Limited Resources, " Descriptional Complexity of Machines with Limited Resources, Journal of Universal Computer Science 8, pp. 193--234, 2002

H. Leung, " Tight lower bounds on the size of sweeping automata, " Tight lower bounds on the size of sweeping automata, Journal of Computer and System Sciences 63, 384--393. , 2001

H. Leung and D. Wotschke, " On the size of parsers and LR(k)-grammars, " On the size of parsers and LR(k)-grammars, Theoretical Computer Science 242, pp. 59--69. , 2000

H. Leung, T. H. Tse, F. T. Chan, T. Y. Chen, " Test case selection with and without replacement, " Test case selection with and without replacement, Information Sciences 129, pp. 81--103. , 2000

H. Leung and T.Y. Chen, " A new perspective of the proportional sampling strategy, " A new perspective of the proportional sampling strategy, The Computer Journal 42, pp. 693--698. , 1999