{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T00:59:19Z","timestamp":1768697959456,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319200279","type":"print"},{"value":"9783319200286","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_26","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"258-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Prefix and Right-Partial Derivative Automata"],"prefix":"10.1007","author":[{"given":"Eva","family":"Maia","sequence":"first","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"VM Antimirov","year":"1996","unstructured":"Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291\u2013319 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"26_CR2","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1142\/S0129054112400400","volume":"23","author":"S Broda","year":"2012","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average size of Glushkov and partial derivative automata. Int. J. Found. Comput. Sci. 23(5), 969\u2013984 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"7","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1142\/S0129054111008908","volume":"22","author":"S Broda","year":"2011","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average state complexity of partial derivative automata. Int. J. Found. Comput. Sci. 22(7), 1593\u20131606 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-37064-9_19","volume-title":"Language and Automata Theory and Applications","author":"JM Champarnaud","year":"2013","unstructured":"Champarnaud, J.M., Dubernard, J.P., Jeanne, H., Mignot, L.: Two-sided derivatives for regular expressions and for hairpin expressions. In: Dediu, A.H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 202\u2013213. Springer, Heidelberg (2013)"},{"issue":"3","key":"26_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FUN-2001-45303","volume":"45","author":"JM Champarnaud","year":"2001","unstructured":"Champarnaud, J.M., Ziadi, D.: From Mirkin\u2019s prebases to Antimirov\u2019s word partial derivatives. Fundam. Inform. 45(3), 195\u2013205 (2001)","journal-title":"Fundam. Inform."},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(01)00267-5","volume":"289","author":"JM Champarnaud","year":"2002","unstructured":"Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289(1), 137\u2013163 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR7","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2008","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. CUP, Cambridge (2008)"},{"key":"26_CR8","unstructured":"Giammarresi, D., Ponty, J.L., Wood, D.: The Glushkov and Thompson constructions: a synthesis (1998) (unpublished manuscript)"},{"issue":"5","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16(5), 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"issue":"1","key":"26_CR10","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. 186(1), 140\u2013162 (2003)","journal-title":"Inf. Comput."},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-319-08846-4_18","volume-title":"Implementation and Application of Automata","author":"S Ko","year":"2014","unstructured":"Ko, S., Han, Y.: Left is better than right for reducing nondeterminism of NFAs. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 238\u2013251. Springer, Heidelberg (2014)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/978-3-319-08846-4_20","volume-title":"Implementation and Application of Automata","author":"E Maia","year":"2014","unstructured":"Maia, E., Moreira, N., Reis, R.: Partial derivative and position bisimilarity automata. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 264\u2013277. Springer, Heidelberg (2014)"},{"key":"26_CR13","first-page":"110","volume":"5","author":"B Mirkin","year":"1966","unstructured":"Mirkin, B.: An algorithm for constructing a base in a language of regular expressions. Eng. Cybern. 5, 110\u2013116 (1966)","journal-title":"Eng. Cybern."},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-00982-2_53","volume-title":"Language and Automata Theory and Applications","author":"C Nicaud","year":"2009","unstructured":"Nicaud, C.: On the average size of Glushkov\u2019s automata. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 626\u2013637. Springer, Heidelberg (2009)"},{"issue":"6","key":"26_CR15","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Com. ACM 11(6), 410\u2013422 (1968)","journal-title":"Com. ACM"},{"key":"26_CR16","first-page":"249","volume-title":"NCMA","author":"H Yamamoto","year":"2014","unstructured":"Yamamoto, H.: A new finite automaton construction for regular expressions. In: Bensch, S., Freund, R., Otto, F. (eds.) NCMA, pp. 249\u2013264. \u00d6sterreichische Computer Gesellschaft, Kassel (2014). books@ocg.at"}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:09:31Z","timestamp":1748459371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}