Ph.D., Pennsylvania State University (1987)
Website: https://www.cs.nmsu.edu/~hleung
Hing obtained his B.Sc. degree in Applied Mathematics from the University of Hong Kong in 1981, and Ph.D. degree in Computer Science from Pennsylvania State University in 1987. Between 1981 and 1983, he had worked as a teaching assistant, and an assistant computer officer for the Computer Center of the University of Hong Kong. Hing has been a faculty of the computer science department at NMSU since 1987.
Hing’s research area is in theoretical computer science. He interested in the understanding of basic concepts in computer science. The research problems that he have tackled are often related to basic concepts and models covered in an undergraduate computer science curriculum, which includes the concepts of nondeterminism, ambiguity, two-way processing, finite automata, pushdown automata, parsers and LR(k)-grammars.
Hing also studied extensively on the model of distance automata, which is a simple extension to the finite automata model. Distance automata is introduced initially for the study of the star height problem of regular languages. It is also used in the study of the measure of nondeterminism in finite automata.
Hing’s current interests include the study of distance automata and the descriptional complexity of different models of finite automata.
