{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:08:21Z","timestamp":1767229701779,"version":"3.48.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934880"},{"type":"electronic","value":"9783030934897"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-93489-7_9","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"100-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial Derivative Automaton by\u00a0Compressing Regular Expressions"],"prefix":"10.1007","author":[{"given":"Stavros","family":"Konstantinidis","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio","family":"Machiavelo","sequence":"additional","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"2","key":"9_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. Theoret. Comput. Sci. 155(2), 291\u2013319 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"9_CR2","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: an analytic combinatorics approach. Int. J. Found. Comput. Sci. 22(7), 1593\u20131606 (2011). https:\/\/doi.org\/10.1142\/S0129054111008908","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"9_CR3","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). https:\/\/doi.org\/10.1142\/S0129054112400400","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6\u20137","key":"9_CR4","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1142\/S0129054119400227","volume":"30","author":"S Broda","year":"2019","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On average behaviour of regular expressions in strong star normal form. Int. J. Found. Comput. Sci. 30(6\u20137), 899\u2013920 (2019). https:\/\/doi.org\/10.1142\/S0129054119400227","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/3388392.3388400","volume":"51","author":"S Broda","year":"2020","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Analytic combinatorics and descriptional complexity of regular languages on average. ACM SIGACT News 51(1), 38\u201356 (2020). https:\/\/doi.org\/10.1145\/3388392.3388400","journal-title":"ACM SIGACT News"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"48","author":"A Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theoret. Comput. Sci. 48, 197\u2013213 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR7","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. Theoret. Comput. Sci. 289, 137\u2013163 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1142\/S0218196701000772","volume":"11","author":"J Champarnaud","year":"2001","unstructured":"Champarnaud, J., Ziadi, D.: From c-continuations to new quadratic algorithms for automaton synthesis. Int. J. Algor. Comput. 11(6), 707\u2013736 (2001)","journal-title":"Int. J. Algor. Comput."},{"key":"9_CR9","unstructured":"Cochran, W.G.: Sampling Techniques, 3rd edn., John Wiley and Sons, New York (1977)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. CUP, Cambridge (2007)","DOI":"10.1017\/CBO9780511546853"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"PJ Downey","year":"1980","unstructured":"Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpression problem. J. ACM 27(4), 758\u2013771 (1980). https:\/\/doi.org\/10.1145\/322217.322228","journal-title":"J. ACM"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. CUP, Cambridge (2008)","DOI":"10.1017\/CBO9780511801655"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BFb0032034","volume-title":"Automata, Languages and Programming","author":"P Flajolet","year":"1990","unstructured":"Flajolet, P., Sipala, P., Steyaert, J.-M.: Analytic variations on the common subexpression problem. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 220\u2013234. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032034"},{"key":"9_CR14","volume-title":"Simplifying regular expressions: a quantitative perspective","author":"H Gruber","year":"2009","unstructured":"Gruber, H., Gulan, S.: Simplifying regular expressions: a quantitative perspective. Tech. rep, IFIG Research Report (2009)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Hille, E.: Analytic Function Theory, vol. 2. Blaisdell Publishing Company, New York (1962)","DOI":"10.1063\/1.3057867"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.jda.2007.10.003","volume":"6","author":"A Khorsi","year":"2008","unstructured":"Khorsi, A., Ouardi, F., Ziadi, D.: Fast equation automaton computation. J. Discrete Algor. 6(3), 433\u2013448 (2008). https:\/\/doi.org\/10.1016\/j.jda.2007.10.003","journal-title":"J. Discrete Algor."},{"issue":"4","key":"9_CR17","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00236-021-00399-6","volume":"58","author":"S Konstantinidis","year":"2021","unstructured":"Konstantinidis, S., Machiavelo, A., Moreira, N., Reis, R.: On the size of partial derivatives and the word membership problem. Acta Inf. 58(4), 357\u2013375 (2021). https:\/\/doi.org\/10.1007\/s00236-021-00399-6","journal-title":"Acta Inf."},{"key":"9_CR18","first-page":"51","volume":"5","author":"BG Mirkin","year":"1966","unstructured":"Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Eng. Cybernet. 5, 51\u201357 (1966)","journal-title":"Eng. Cybernet."},{"key":"9_CR19","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). https:\/\/doi.org\/10.1007\/978-3-642-00982-2_53"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93489-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:03:30Z","timestamp":1767229410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/toc.yonsei.ac.kr\/dcfs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}