{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:41:39Z","timestamp":1757450499241,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_12","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"206-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection"],"prefix":"10.1007","author":[{"given":"Florent","family":"Koechlin","sequence":"first","affiliation":[]},{"given":"Pablo","family":"Rotondo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11821069_10","volume-title":"Mathematical Foundations of Computer Science 2006","author":"C Allauzen","year":"2006","unstructured":"Allauzen, C., Mohri, M.: A unified construction of the glushkov, follow, and antimirov automata. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 110\u2013121. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11821069_10"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/3-540-59042-0_96","volume-title":"STACS 95","author":"V Antimirov","year":"1995","unstructured":"Antimirov, V.: Partial derivatives of regular expressions and finite automata constructions. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 455\u2013466. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_96"},{"key":"12_CR3","doi-asserted-by":"publisher","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","DOI":"10.1142\/S0129054112400400"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 120(2), 197\u2013213 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90287-4, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397593902874","DOI":"10.1016\/0304-3975(93)90287-4"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Chauvin, B., Gardy, D., Mailler, C.: The growing tree distribution on boolean functions. In: 2011 Proceedings of the Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 45\u201356 (2011). https:\/\/doi.org\/10.1137\/1.9781611973013.5, https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611973013.5","DOI":"10.1137\/1.9781611973013.5"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Devroye, L.: Simulating size-constrained galton-watson trees. SIAM J. Comput. 41(1), 1\u201311 (2012). https:\/\/doi.org\/10.1137\/090766632","DOI":"10.1137\/090766632"},{"issue":"1\u20132","key":"12_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<103::AID-RSA5>3.0.CO;2-Z","volume":"10","author":"M Drmota","year":"1997","unstructured":"Drmota, M.: Systems of functional equations. Random Struct. Algorithms 10(1\u20132), 103\u2013124 (1997)","journal-title":"Random Struct. Algorithms"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Flajolet, P., Gourdon, X., Martinez, C.: Patterns in random binary search trees. Random Struct. Algorithms 11(3), 223\u2013244 (1997). https:\/\/doi.org\/10.1002\/(SICI)1098-2418(199710)11:3<223::AID-RSA2>3.0.CO;2-2","DOI":"10.1002\/(SICI)1098-2418(199710)11:3<223::AID-RSA2>3.0.CO;2-2"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)","DOI":"10.1017\/CBO9780511801655"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Gardy, D.: Random boolean expressions. In: DMTCS Proceedings, vol. AF, Computational Logic and Applications (CLA \u201905), pp. 1\u201336. Discrete Mathematics & Theoretical Computer Science, Episciences. org (2005)","DOI":"10.46298\/dmtcs.3475"},{"key":"12_CR11","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"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Ilie, L., Yu, S.: Follow automata. Inform. Comput. 186(1), 140\u2013162 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00090-7, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540103000907","DOI":"10.1016\/S0890-5401(03)00090-7"},{"key":"12_CR13","unstructured":"Koechlin, F., Nicaud, C., Rotondo, P.: Uniform random expressions lack expressivity. In: Rossmanith, P., Heggernes, P., Katoen, J. (eds.) 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26\u201330, 2019, Aachen, Germany. LIPIcs, vol. 138, pp. 51:1\u201351:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Koechlin, F., Rotondo, P.: Absorbing patterns in BST-like expression-trees. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 187, pp. 48:1\u201348:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.48, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/13693","DOI":"10.4230\/LIPIcs.STACS.2021.48"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-30500-2_2","volume-title":"Implementation and Application of Automata","author":"J Lee","year":"2005","unstructured":"Lee, J., Shallit, J.: Enumerating regular expressions and their languages. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 2\u201322. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30500-2_2"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (Swat 1972), pp. 125\u2013129. SWAT \u201972, IEEE Computer Society, USA (1972). https:\/\/doi.org\/10.1109\/SWAT.1972.29","DOI":"10.1109\/SWAT.1972.29"},{"key":"12_CR17","unstructured":"Tauriainen, H.: Automated testing of B\u00fcchi automata translators for linear temporal logic. Research Report A66, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2000"},{"key":"12_CR18","unstructured":"Yamamoto, H.: A new finite automaton construction for regular expressions. In: Bensch, S., Freund, R., Otto, F. (eds.) Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28\u201329, 2014. Proceedings. books@ocg.at, vol. 304, pp. 249\u2013264. \u00d6sterreichische Computer Gesellschaft (2014)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T11:50:29Z","timestamp":1672487429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_12","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":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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":"0","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":"41% - 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.1","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":"9.2","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)"}}]}}