Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Câmpeanu, C., Pǎun, A., Yu, S.: An efficient algorithm for constructing minimal cover automata for finite languages. Int. J. Found. Comput. Sci. 13(1), 83–97 (2002)
Câmpeanu, C., Santean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1-2), 3–16 (2001)
Câmpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci. 14(6), 1007–1018 (2003)
Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of combined operations with two basic operations. Theoret. Comput. Sci. (2012), doi:10.1016/j.tcs.2012.02.030
Gao, Y., Lu, H., Seki, S., Yu, S. (eds.): DLT 2010. LNCS, vol. 6224. Springer, Heidelberg (2010)
Ilie, L., Rozenberg, G., Salomaa, A., Salomaa, K. (eds.): Formal Languages and Applications: A Collection of Papers in Honor of Sheng Yu. Theoret. Comput. Sci., vol. 410(24-25) (2009)
Ilie, L., Yu, S.: Follow automata. Inf. Comput. 186(1), 140–162 (2003)
Ilie, L., Yu, S., Zhang, K.: Word complexity and repetitions in words. Int. J. Found. Comput. Sci. 15(1), 41–55 (2004)
Konstantinidis, S., Santean, N., Yu, S.: On implementing recognizable transductions. Int. J. Comput. Math. 87(2), 260–277 (2010)
Salomaa, A., Salomaa, K., Yu, S.: Undecidability of the State Complexity of Composed Regular Operations. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 489–498. Springer, Heidelberg (2011)
Salomaa, A., Wood, D., Yu, S. (eds.): A Half-Century of Automata Theory: Celebration and Inspiration. World Scientific (2001)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 41–110. Springer (1997)
Yu, S.: Grail+: A symbolic computation environment for finite-state machines, regular expressions and finite languages (2002), http://www.csd.uwo.ca/Research/grail
Yu, S., Gao, Y.: State Complexity Research and Approximation. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 46–57. Springer, Heidelberg (2011)
Yu, S., Păun, A. (eds.): CIAA 2000. LNCS, vol. 2088. Springer, Heidelberg (2001)
Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoret. Comput. Sci. 125, 315–328 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, Y., Salomaa, K. (2012). In Memoriam Sheng Yu. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-31606-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31605-0
Online ISBN: 978-3-642-31606-7
eBook Packages: Computer ScienceComputer Science (R0)