{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:08:16Z","timestamp":1742915296380,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_1","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["In Memoriam Sheng Yu"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1142\/S0129054102000960","volume":"13","author":"C. C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., P\u01ceun, A., Yu, S.: An efficient algorithm for constructing minimal cover automata for finite languages. Int. J. Found. Comput. Sci.\u00a013(1), 83\u201397 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1-2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00292-9","volume":"267","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Santean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci.\u00a0267(1-2), 3\u201316 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1142\/S012905410300214X","volume":"14","author":"C. C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci.\u00a014(6), 1007\u20131018 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1016\/j.tcs.2012.02.030"},{"key":"1_CR5","series-title":"LNCS","volume-title":"Developments in Language Theory","year":"2010","unstructured":"Gao, Y., Lu, H., Seki, S., Yu, S. (eds.): DLT 2010. LNCS, vol.\u00a06224. Springer, Heidelberg (2010)"},{"key":"1_CR6","unstructured":"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.\u00a0410(24-25) (2009)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/S0890-5401(03)00090-7","volume":"186","author":"L. Ilie","year":"2003","unstructured":"Ilie, L., Yu, S.: Follow automata. Inf. Comput.\u00a0186(1), 140\u2013162 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1142\/S0129054104002297","volume":"15","author":"L. Ilie","year":"2004","unstructured":"Ilie, L., Yu, S., Zhang, K.: Word complexity and repetitions in words. Int. J. Found. Comput. Sci.\u00a015(1), 41\u201355 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1080\/00207160801968754","volume":"87","author":"S. Konstantinidis","year":"2010","unstructured":"Konstantinidis, S., Santean, N., Yu, S.: On implementing recognizable transductions. Int. J. Comput. Math.\u00a087(2), 260\u2013277 (2010)","journal-title":"Int. J. Comput. Math."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-21254-3_39","volume-title":"Language and Automata Theory and Applications","author":"A. Salomaa","year":"2011","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: Undecidability of the State Complexity of Composed Regular Operations. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 489\u2013498. Springer, Heidelberg (2011)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Salomaa, A., Wood, D., Yu, S. (eds.): A Half-Century of Automata Theory: Celebration and Inspiration. World Scientific (2001)","DOI":"10.1142\/4672"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"1_CR13","unstructured":"Yu, S.: Grail+: A symbolic computation environment for finite-state machines, regular expressions and finite languages (2002), \n                      http:\/\/www.csd.uwo.ca\/Research\/grail"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-22321-1_5","volume-title":"Developments in Language Theory","author":"S. Yu","year":"2011","unstructured":"Yu, S., Gao, Y.: State Complexity Research and Approximation. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 46\u201357. Springer, Heidelberg (2011)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Implementation and Application of Automata","year":"2001","unstructured":"Yu, S., P\u0103un, A. (eds.): CIAA 2000. LNCS, vol.\u00a02088. Springer, Heidelberg (2001)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T05:35:10Z","timestamp":1676784910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}