论文信息 - In Memoriam Sheng Yu

In Memoriam Sheng Yu

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.

Yuan Gao | Kai Salomaa | K. Salomaa | Yuan Gao

[1] Stavros Konstantinidis,et al. On implementing recognizable transductions , 2010, Int. J. Comput. Math..

[2] Sheng Yu,et al. Minimal cover-automata for finite languages , 2001, Theor. Comput. Sci..

[3] Wojciech Rytter,et al. On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[4] Yuan Gao,et al. State Complexity of Combined Operations with Two Basic Operations , 2022 .

[5] Derick Wood,et al. A Half-Century of Automata Theory: Celebration and Inspiration , 2001, A Half-Century of Automata Theory.

[6] Arto Salomaa,et al. Undecidability of the State Complexity of Composed Regular Operations , 2011, LATA.

[7] Lucian Ilie,et al. Follow automata , 2003, Inf. Comput..

[8] Yuan Gao,et al. State Complexity Research and Approximation , 2011, Developments in Language Theory.

[9] Kaizhong Zhang,et al. Word Complexity And Repetitions In Words , 2004, Int. J. Found. Comput. Sci..

[10] Sheng Yu,et al. The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[11] Grzegorz Rozenberg,et al. Developments in Language Theory II , 2002 .

[12] Sheng Yu,et al. A Formal Study Of Practical Regular Expressions , 2003, Int. J. Found. Comput. Sci..

[13] Borivoj Melichar,et al. Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[14] Andrei Paun,et al. An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages , 2002, Int. J. Found. Comput. Sci..