The state complexities of some basic operations on regular languages
Theoretical Computer Science
Handbook of formal languages, vol. 1
Minimal cover-automata for finite languages
Theoretical Computer Science
Information and Computation
On implementing recognizable transductions
International Journal of Computer Mathematics
Undecidability of the state complexity of composed regular operations
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity research and approximation
DLT'11 Proceedings of the 15th international conference on Developments in language theory
State complexity of combined operations with two basic operations
Theoretical Computer Science
| Hi-index | 0.00 |
Professor Sheng Yu passed away unexpectedly in London, Canada on January 23, 2012, one day before his 62nd birthday. Sheng was one of the world leading theoretical computer scientists. His strong commitment to excellence in scholarship has touched everyone who has worked or studied with him. This includes a large segment of the "CIAA community" and, in particular, the authors of the current article. Sheng Yu's work will continue to influence and inspire automata theory research for a long time to come. Sheng's undergraduate studies were delayed by China's cultural revolution, however, this did not prevent him from achieving a brilliant academic career. He completed his Ph.D. in 1986 in Waterloo, Canada, under the guidance of Karel Culik II. In the late 1980's Sheng taught for a few years at Kent State University and after that has been with the Computer Science Department at the University of Western Ontario in London, Canada.