{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T04:15:47Z","timestamp":1745554547837,"version":"3.40.3"},"publisher-location":"Cham","reference-count":78,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031074684"},{"type":"electronic","value":"9783031074691"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07469-1_2","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T14:20:31Z","timestamp":1653661231000},"page":"19-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Manipulation of\u00a0Regular Expressions Using Derivatives: An Overview"],"prefix":"10.1007","author":[{"given":"Nelma","family":"Moreira","sequence":"first","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Adams, M.D., Hollenbeck, C., Might, M.: On the complexity and performance of parsing with derivatives. In: Krintz, C., Berger, E. (eds.) Proceedings 37th ACM SIGPLAN PLDI, pp. 224\u2013236. ACM (2016). https:\/\/doi.org\/10.1145\/2908080.2908128","DOI":"10.1145\/2908080.2908128"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1142\/S0129054109006802","volume":"20","author":"M Almeida","year":"2009","unstructured":"Almeida, M., Moreira, N., Reis, R.: Antimirov and Mosses\u2019 rewrite system revisited. Int. J. Found. Comput. Sci. 20(4), 669\u2013684 (2009). https:\/\/doi.org\/10.1142\/S0129054109006802","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Almeida, M., Moreira, N., Reis, R.: Testing equivalence of regular languages. J. Autom. Lang. Comb. 15(1\/2), 7\u201325 (2010). https:\/\/doi.org\/10.25596\/jalc-2010-007","DOI":"10.25596\/jalc-2010-007"},{"issue":"2","key":"2_CR4","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). https:\/\/doi.org\/10.1016\/0304-3975(95)00182-4","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR5","unstructured":"Antimirov, V.M., Mosses, P.: Rewriting extended regular expressions. In: Rozenberg, G., Salomaa, A. (eds.) Developments in Language Theory, pp. 195\u2013209. World Scientific (1994)"},{"key":"2_CR6","unstructured":"Asperti, A., Coen, C.S., Tassi, E.: Regular expressions, au point. CoRR abs\/1010.2604 (2010). http:\/\/arxiv.org\/abs\/1010.2604"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41114-9","volume-title":"Descriptional Complexity of Formal Systems","year":"2016","unstructured":"C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.): DCFS 2016. LNCS, vol. 9777. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41114-9"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Bastos, R., Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average complexity of partial derivative automata for semi-extended expressions. J. Autom. Lang. Comb. 22(1\u20133), 5\u201328 (2017). https:\/\/doi.org\/10.25596\/jalc-2017-005","DOI":"10.25596\/jalc-2017-005"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G Berry","year":"1986","unstructured":"Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Comput. Sci. 48, 117\u2013126 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Giacobazzi, R., Cousot, R. (eds.) Proceedings 40th POPL 2013, pp. 457\u2013468. ACM (2013). https:\/\/doi.org\/10.1145\/2429069.2429124","DOI":"10.1145\/2429069.2429124"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ic.2019.01.003","volume":"265","author":"S Broda","year":"2019","unstructured":"Broda, S., Holzer, M., Maia, E., Moreira, N., Reis, R.: A mesh of automata. Inf. Comput. 265, 94\u2013111 (2019). https:\/\/doi.org\/10.1016\/j.ic.2019.01.003","journal-title":"Inf. Comput."},{"issue":"7","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1142\/S012905","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\/S012905","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"2_CR13","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."},{"key":"2_CR14","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Average size of automata constructions from regular expressions. Bull. Eur. Assoc. Theor. Comput. Sci. 116, 167\u2013192 (2015). http:\/\/bulletin.eatcs.org\/index.php\/beatcs\/article\/view\/352\/334"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-662-53132-7_5","volume-title":"Developments in Language Theory","author":"S Broda","year":"2016","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Position automaton construction for regular expressions with intersection. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 51\u201363. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53132-7_5"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ic.2017.08.013","volume":"259","author":"S Broda","year":"2018","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Automata for regular expressions with shuffle. Inf. Comput. 259(2), 162\u2013173 (2018). https:\/\/doi.org\/10.1016\/j.ic.2017.08.013","journal-title":"Inf. Comput."},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/3388392.3388401","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)","journal-title":"ACM SIGACT News"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-030-68195-1_4","volume-title":"Language and Automata Theory and Applications","author":"S Broda","year":"2021","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Location based automata for expressions with shuffle. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 43\u201354. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_4"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Broda, S., Maia, E., Moreira, N., Reis, R.: The prefix automaton. J. Autom. Lang. Comb. 26(1\u20132), 17\u201353 (2021). https:\/\/doi.org\/10.25596\/jalc-2021-017","DOI":"10.25596\/jalc-2021-017"},{"key":"2_CR20","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":"2_CR21","doi-asserted-by":"crossref","unstructured":"Brzozowski, Jr. J.A., McCluskey, E.J.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. Electron. Comput. EC-12(2), 67\u201376 (1963)","DOI":"10.1109\/PGEC.1963.263416"},{"key":"2_CR22","unstructured":"Brzozowski, J.: Regular expression techniques for sequential circuits. Ph.D. thesis, Department of Electrical Engineering, Princeton University (1962)"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Brzozowski, J.A.: Quotient complexity of regular languages 15(1\/2), 71\u201389 (2010). https:\/\/doi.org\/10.25596\/jalc-2010-071","DOI":"10.25596\/jalc-2010-071"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"JA Brzozowski","year":"1980","unstructured":"Brzozowski, J.A., Leiss, E.L.: On equations for regular languages, finite automata, and sequential networks. Theor. Comput. Sci. 10, 19\u201335 (1980). https:\/\/doi.org\/10.1016\/0304-3975(80)90069-9","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J Brzozowski","year":"1964","unstructured":"Brzozowski, J.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964). https:\/\/doi.org\/10.1145\/321239.321249","journal-title":"J. ACM"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Cardoso, E.M., Amaro, M., da Silva Feitosa, S., dos Santos Reis, L.V., Bois, A.R.D., Ribeiro, R.G.: The design of a verified derivative-based parsing tool for regular expressions. CLEI Electron. J. 24(3) (2021). https:\/\/doi.org\/10.19153\/cleiej.24.3.2","DOI":"10.19153\/cleiej.24.3.2"},{"issue":"3","key":"2_CR27","first-page":"195","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."},{"key":"2_CR28","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). https:\/\/doi.org\/10.1016\/S0304-3975(01)00267-5","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-73208-2_16","volume-title":"Developments in Language Theory","author":"J-M Champarnaud","year":"2007","unstructured":"Champarnaud, J.-M., Ouardi, F., Ziadi, D.: An efficient computation of the equation $$\\mathbb{K}$$-automaton of a regular $$\\mathbb{K}$$-expression. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 145\u2013156. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73208-2_16"},{"issue":"4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1080\/00207169908804865","volume":"72","author":"J Champarnaud","year":"1999","unstructured":"Champarnaud, J., Ponty, J., Ziadi, D.: From regular expressions to finite automata. Int. J. Comput. Math. 72(4), 415\u2013431 (1999). https:\/\/doi.org\/10.1080\/00207169908804865","journal-title":"Int. J. Comput. Math."},{"issue":"6","key":"2_CR31","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. Alg. Comput. 11(6), 707\u2013736 (2001)","journal-title":"Int. J. Alg. Comput."},{"issue":"1\u20132","key":"2_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00140-5","volume":"178","author":"C Chang","year":"1997","unstructured":"Chang, C., Paige, R.: From regular expressions to DFA\u2019s using compressed NFA\u2019s. Theor. Comput. Sci. 178(1\u20132), 1\u201336 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(96)00140-5","journal-title":"Theor. Comput. Sci."},{"key":"2_CR33","volume-title":"Regular Algebra and Finite Machines","author":"JH Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-40946-7_5","volume-title":"Implementation and Application of Automata","author":"A Demaille","year":"2016","unstructured":"Demaille, A.: Derived-term automata of multitape rational expressions. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 51\u201363. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40946-7_5"},{"key":"2_CR35","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"},{"issue":"2","key":"2_CR36","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1145\/321386.321399","volume":"14","author":"A Ginzburg","year":"1967","unstructured":"Ginzburg, A.: A procedure for checking equality of regular expressions. J. ACM 14(2), 355\u2013362 (1967). https:\/\/doi.org\/10.1145\/321386.321399","journal-title":"J. ACM"},{"key":"2_CR37","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, 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-13089-2_24","volume-title":"Language and Automata Theory and Applications","author":"H Gruber","year":"2010","unstructured":"Gruber, H., Gulan, S.: Simplifying regular expressions. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 285\u2013296. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13089-2_24"},{"issue":"8","key":"2_CR39","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1142\/S0129054115400110","volume":"26","author":"H Gruber","year":"2015","unstructured":"Gruber, H., Holzer, M.: From finite automata to regular expressions and back\u2013a summary on descriptional complexity. Int. J. Found. Comput. Sci. 26(8), 1009\u20131040 (2015). https:\/\/doi.org\/10.1142\/S0129054115400110","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M.: The complexity of regular(-like) expressions. Int. J. Found. Comput. Sci. 22(7), 1533\u20131548 (2011)","DOI":"10.1142\/S0129054111008866"},{"key":"2_CR41","unstructured":"Hopcroft, J., Karp, R.M.: A linear algorithm for testing equivalence of finite automata. Technical report, TR 71\u2013114, University of California, Berkeley, California (1971)"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Kapp\u00e9, T., Brunet, P., Luttik, B., Silva, A., Zanasi, F.: Brzozowski goes concurrent - a Kleene theorem for pomset languages. In: Meyer, R., Nestmann, U. (eds.) Proceedings 28th CONCUR 2017. LIPIcs, vol. 85, pp. 25:1\u201325:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.25","DOI":"10.4230\/LIPIcs.CONCUR.2017.25"},{"issue":"3","key":"2_CR43","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 Algorithms 6(3), 433\u2013448 (2008). https:\/\/doi.org\/10.1016\/j.jda.2007.10.003","journal-title":"J. Discrete Algorithms"},{"key":"2_CR44","first-page":"3","volume-title":"Automata Studies","author":"SC Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3\u201341. Princeton University Press, Princeton (1956)"},{"key":"2_CR45","doi-asserted-by":"publisher","unstructured":"Konstantinidis, S., Machiavelo, A., Moreira, N., Reis, R.: Partial derivative automaton by compressing regular expressions. In: Yan, Y., Ko, S. (eds.) Proceedings 23rd DCFS 2021. LNCS, vol. 13037, pp. 100\u2013112. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93489-7_9","DOI":"10.1007\/978-3-030-93489-7_9"},{"issue":"4","key":"2_CR46","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 Informatica 58(4), 357\u2013375 (2021). https:\/\/doi.org\/10.1007\/s00236-021-00399-6","journal-title":"Acta Informatica"},{"key":"2_CR47","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2020.12.029","volume":"870","author":"S Konstantinidis","year":"2021","unstructured":"Konstantinidis, S., Moreira, N., Reis, R.: Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. Theor. Comput. Sci. 870, 103\u2013120 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.12.029","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2_CR48","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1142\/S0218196792000062","volume":"2","author":"D Krob","year":"1992","unstructured":"Krob, D.: Differentiation of K-rational expressions. Int. J. Algebra Comput. 2(1), 57\u201388 (1992). https:\/\/doi.org\/10.1142\/S0218196792000062","journal-title":"Int. J. Algebra Comput."},{"issue":"3","key":"2_CR49","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(81)90070-2","volume":"23","author":"EL Leiss","year":"1981","unstructured":"Leiss, E.L.: The complexity of restricted regular expressions and the synthesis problem for finite automata. J. Comput. Syst. Sci. 23(3), 348\u2013354 (1981). https:\/\/doi.org\/10.1016\/0022-0000(81)90070-2","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20133","key":"2_CR50","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2004.10.016","volume":"332","author":"S Lombardy","year":"2005","unstructured":"Lombardy, S., Sakarovitch, J.: Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332(1\u20133), 141\u2013177 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.10.016","journal-title":"Theor. Comput. Sci."},{"key":"2_CR51","doi-asserted-by":"publisher","unstructured":"Lombardy, S., Sakarovitch, J.: Derived terms without derivation a shifted perspective on the derived-term automaton. J. Comput. Sci. Cybern. 37(3), 201\u2013221 (2021). https:\/\/doi.org\/10.15625\/1813-9663\/37\/3\/16263","DOI":"10.15625\/1813-9663\/37\/3\/16263"},{"key":"2_CR52","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02478259","volume":"5","author":"W McCulloch","year":"1943","unstructured":"McCulloch, W., Pitts, W.: A logical calculus of the ideas immanent in nervous activity. Bull. Math. Biophisics 5, 115\u2013133 (1943)","journal-title":"Bull. Math. Biophisics"},{"key":"2_CR53","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IEEE Trans. Electron. Comput. 9, 39\u201347 (1960)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"2_CR54","unstructured":"Mignot, L.: A unified implementation of automata and expression structures, and of the associated algorithms using enriched categories. CoRR abs\/2012.10641 (2020). https:\/\/arxiv.org\/abs\/2012.10641"},{"issue":"1","key":"2_CR55","doi-asserted-by":"publisher","first-page":"69","DOI":"10.3233\/FI-2017-1598","volume":"156","author":"L Mignot","year":"2017","unstructured":"Mignot, L., Sebti, N.O., Ziadi, D.: Tree automata constructions from regular expressions: a comparative study. Fundam. Informaticae 156(1), 69\u201394 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1598","journal-title":"Fundam. Informaticae"},{"issue":"6","key":"2_CR56","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1142\/S0129054118500156","volume":"29","author":"L Mignot","year":"2018","unstructured":"Mignot, L., Sebti, N.O., Ziadi, D.: An efficient algorithm for the construction of the equation tree automaton. Int. J. Found. Comput. Sci. 29(6), 951\u2013978 (2018). https:\/\/doi.org\/10.1142\/S0129054118500156","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR57","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. Cybern. 5, 51\u201357 (1966)","journal-title":"Eng. Cybern."},{"issue":"3\u20134","key":"2_CR58","first-page":"165","volume":"22","author":"Y Mizoguchi","year":"1987","unstructured":"Mizoguchi, Y., Ohtsuka, H., Kawahara, Y.: Symbolic calculus of regular expressions. Bull. Inf. Cybern. 22(3\u20134), 165\u2013170 (1987)","journal-title":"Bull. Inf. Cybern."},{"issue":"3","key":"2_CR59","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.jlamp.2014.12.004","volume":"84","author":"N Moreira","year":"2015","unstructured":"Moreira, N., Pereira, D., de Sousa, S.M.: Deciding Kleene algebra terms (in)equivalence in Coq. J. Logical Algebraic Methods Program. 84(3), 377\u2013401 (2015). https:\/\/doi.org\/10.1016\/j.jlamp.2014.12.004","journal-title":"J. Logical Algebraic Methods Program."},{"key":"2_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-40608-0_30","volume-title":"Language and Automata Theory and Applications","author":"A Moss","year":"2020","unstructured":"Moss, A.: Simplified parsing expression derivatives. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2020. LNCS, vol. 12038, pp. 425\u2013436. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40608-0_30"},{"key":"2_CR61","unstructured":"Myhill, J.: Finite automata and representation of events. In: Fundamental Concepts in the Theory of Systems, vol. 57. Wright Air Development Center (1957)"},{"key":"2_CR62","doi-asserted-by":"crossref","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Am. Math. Soc. 9, 541\u2013544 (1958)","DOI":"10.1090\/S0002-9939-1958-0135681-9"},{"key":"2_CR63","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"},{"key":"2_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-319-08970-6_29","volume-title":"Interactive Theorem Proving","author":"T Nipkow","year":"2014","unstructured":"Nipkow, T., Traytel, D.: Unified decision procedures for regular expression equivalence. In: Klein, G., Gamboa, R. (eds.) ITP 2014. LNCS, vol. 8558, pp. 450\u2013466. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08970-6_29"},{"issue":"8","key":"2_CR65","doi-asserted-by":"publisher","first-page":"238","DOI":"10.3390\/a14080238","volume":"14","author":"F Ouardi","year":"2021","unstructured":"Ouardi, F., Lotfi, Z., Elghadyry, B.: Efficient construction of the equation automaton. Algorithms 14(8), 238 (2021). https:\/\/doi.org\/10.3390\/a14080238","journal-title":"Algorithms"},{"issue":"6","key":"2_CR66","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987). https:\/\/doi.org\/10.1137\/0216062","journal-title":"SIAM J. Comput."},{"key":"2_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-63174-7_9","volume-title":"Automata Implementation","author":"J-L Ponty","year":"1997","unstructured":"Ponty, J.-L., Ziadi, D., Champarnaud, J.-M.: A new quadratic algorithm to convert a regular expression into an automaton. In: Raymond, D., Wood, D., Yu, S. (eds.) WIA 1996. LNCS, vol. 1260, pp. 109\u2013119. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63174-7_9"},{"issue":"1","key":"2_CR68","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D Revuz","year":"1992","unstructured":"Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theoret. Comput. Sci. 92(1), 181\u2013189 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"2_CR69","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00895-2","volume":"208","author":"J Rutten","year":"2003","unstructured":"Rutten, J.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoret. Comput. Sci. 208(1\u20133), 1\u201353 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00895-2","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR70","doi-asserted-by":"publisher","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/CBO9781139195218","DOI":"10.1017\/CBO9781139195218"},{"key":"2_CR71","doi-asserted-by":"publisher","unstructured":"Sakarovitch, J.: Automata and rational expressions. In: Pin, J. (ed.) Handbook of Automata Theory, pp. 39\u201378. European Mathematical Society Publishing House, Z\u00fcrich (2021). https:\/\/doi.org\/10.4171\/Automata-1\/2","DOI":"10.4171\/Automata-1\/2"},{"issue":"1","key":"2_CR72","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A Salomaa","year":"1966","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. Assoc. Comput. Mach. 13(1), 158\u2013169 (1966)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"2_CR73","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1016\/j.ic.2010.09.007","volume":"209","author":"A Silva","year":"2011","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Quantitative Kleene coalgebras. Inf. Comput. 209(5), 822\u2013849 (2011). https:\/\/doi.org\/10.1016\/j.ic.2010.09.007","journal-title":"Inf. Comput."},{"key":"2_CR74","doi-asserted-by":"publisher","unstructured":"Sulzmann, M., Lu, K.Z.M.: Regular expression sub-matching using partial derivatives. In: Schreye, D.D., Janssens, G., King, A. (eds.) Proceedings PPDP 2012, pp. 79\u201390. ACM (2012). https:\/\/doi.org\/10.1145\/2370776.2370788","DOI":"10.1145\/2370776.2370788"},{"key":"2_CR75","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.jcss.2016.11.010","volume":"104","author":"M Sulzmann","year":"2019","unstructured":"Sulzmann, M., Thiemann, P.: Derivatives and partial derivatives for regular shuffle expressions. J. Comput. Syst. Sci. 104, 323\u2013341 (2019). https:\/\/doi.org\/10.1016\/j.jcss.2016.11.010","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR76","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-662-54458-7_15","volume-title":"Foundations of Software Science and Computation Structures","author":"P Thiemann","year":"2017","unstructured":"Thiemann, P.: Partial derivatives for context-free languages. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 248\u2013264. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_15"},{"issue":"6","key":"2_CR77","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. Commun. ACM 11(6), 410\u2013422 (1968)","journal-title":"Commun. ACM"},{"key":"2_CR78","unstructured":"Yamamoto, H.: A new finite automaton construction for regular expressions. In: Bensch, S., Freund, R., Otto, F. (eds.) 6th NCMA. books@ocg.at, vol. 304, pp. 249\u2013264. \u00d6sterreichische Computer Gesellschaft (2014)"}],"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-031-07469-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T23:05:33Z","timestamp":1655766333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07469-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031074684","9783031074691"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07469-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2022.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}