{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:05:57Z","timestamp":1742911557999,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030865924"},{"type":"electronic","value":"9783030865931"}],"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-86593-1_17","type":"book-chapter","created":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:26:28Z","timestamp":1631391988000},"page":"245-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Minimizing Regular Expressions Without Kleene Star"],"prefix":"10.1007","author":[{"given":"Hermann","family":"Gruber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Wolfsteiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1137\/16M1061771","volume":"47","author":"A Abboud","year":"2015","unstructured":"Abboud, A., Backurs, A., Williams, V.V.: If the current clique algorithms are optimal, so is Valiant\u2019s parlser. SIAM J. Comput. 47(6), 2527\u20132555 (2015)","journal-title":"SIAM J. Comput."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Gr\u00f8nlund, A., Larsen, K.G.: A dichotomy for regular expression membership testing. In: Proceedings of the $$58$$th Annual IEEE Symposium on Foundations of Computer Science, pp. 307\u2013318. IEEE, Berkeley, October 2017","DOI":"10.1109\/FOCS.2017.36"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-662-44777-2_20","volume-title":"Algorithms - ESA 2014","author":"P Chalermsook","year":"2014","unstructured":"Chalermsook, P., Heydrich, S., Holm, E., Karrenbauer, A.: Nearly tight approximability results for minimum biclique cover and partition. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 235\u2013246. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_20"},{"key":"17_CR4","unstructured":"Clemente, L., Mayr, R.: Efficient reduction of nondeterministic automata with application to language inclusion testing. Log. Methods Comput. Sci. 15(1) (2019)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-030-48516-0_6","volume-title":"Developments in Language Theory","author":"M de Oliveira Oliveira","year":"2020","unstructured":"de Oliveira Oliveira, M., Wehar, M.: On the fine grained complexity of finite automata non-emptiness of intersection. In: Jonoska, N., Savchuk, D. (eds.) DLT 2020. LNCS, vol. 12086, pp. 69\u201382. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48516-0_6"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Eberhard, S., Hetzl, St.: On the compressibility of finite languages and formal proofs. Inform. Comput. 259, 191\u2013213 (2018)","DOI":"10.1016\/j.ic.2017.09.001"},{"issue":"4","key":"17_CR7","first-page":"407","volume":"10","author":"K Ellul","year":"2005","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular expressions: new results and open problems. J. Autom. Lang. Comb. 10(4), 407\u2013437 (2005)","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.3390\/a10010024","volume":"10","author":"H Fernau","year":"2017","unstructured":"Fernau, H., Krebs, A.: Problems on finite automata and the exponential time hypothesis. Algorithms 10(1), 24 (2017)","journal-title":"Algorithms"},{"key":"17_CR9","unstructured":"Flor\u00eancio, Ch.C., Daenen, J., Ramon, J., Van den Bussche, J., Van Dyck, D.: Naive infinite enumeration of context-free languages in incremental polynomial time. J. Univ. Comput. Sci. 21(7), 891\u2013911 (2015)"},{"issue":"6","key":"17_CR10","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.jcss.2006.11.002","volume":"73","author":"G Gramlich","year":"2007","unstructured":"Gramlich, G., Schnitger, G.: Minimizing NFA\u2019s and regular expressions. J. Comput. Syst. Sci. 73(6), 908\u2013923 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR11","unstructured":"Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: Preproceedings of the 1st International Conference on Language and Automata Theory and Applications, Technical Report 35\/07, pp. 261\u2013272. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, March 2007"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-73208-2_21","volume-title":"Developments in Language Theory","author":"H Gruber","year":"2007","unstructured":"Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P $$\\ne $$ NP. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 205\u2013216. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73208-2_21"},{"issue":"35","key":"17_CR13","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.tcs.2009.04.009","volume":"410","author":"H Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. Theoret. Comput. Sci. 410(35), 3281\u20133289 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR14","unstructured":"Gruber, H., Holzer, M.: Optimal regular expressions for palindromes of given length. In: Bonchi, F., Puglisi, S.J. (eds.) Proceedings of the $$46$$th International Symposium on Mathematical Foundations of Computer Science, Leibniz International Proceedings in Informatics. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2021, accepted)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-319-98654-8_28","volume-title":"Developments in Language Theory","author":"H Gruber","year":"2018","unstructured":"Gruber, H., Holzer, M., Wolfsteiner, S.: On minimal grammar problems for finite languages. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 342\u2013353. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_28"},{"key":"17_CR16","unstructured":"Gruber, H., Lee, J., Shallit, J.: Enumerating regular expressions and their languages. arXiv:1204.4982 [cs.FL], April 2012"},{"key":"17_CR17","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Hunt III, H.B.: On the time and tape complexity of languages I. In: Proceedings of the $$5$$th Annual ACM Symposium on Theory of Computing, pp. 10\u201319. ACM, Austin, April-May 1973","DOI":"10.1145\/800125.804030"},{"issue":"4","key":"17_CR19","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR20","first-page":"41","volume":"105","author":"D Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. Eur. Assoc. Theor. Comput. Sci. 105, 41\u201372 (2011)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"17_CR21","unstructured":"Mandl, R.: Precise bounds associated with the subset construction on various classes of nondeterministic finite automata. In: Proceedings of the $$7$$th Princeton Conference on Information and System Sciences, pp. 263\u2013267, March 1973"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L. J.: The equivalence problem for regular expressions with squaring requires exponential time. In: Proceedings of the $$13$$th Annual Symposium on Switching and Automata Theory, pp. 125\u2013129. IEEE Society Press, October 1972","DOI":"10.1109\/SWAT.1972.29"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-030-23679-3_17","volume-title":"Implementation and Application of Automata","author":"F Mr\u00e1z","year":"2019","unstructured":"Mr\u00e1z, F., Pr\u016f\u0161a, D., Wehar, M.: Two-dimensional pattern matching against basic picture languages. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G. (eds.) CIAA 2019. LNCS, vol. 11601, pp. 209\u2013221. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23679-3_17"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-662-43951-7_30","volume-title":"Automata, Languages, and Programming","author":"M Wehar","year":"2014","unstructured":"Wehar, M.: Hardness results for intersection non-emptiness. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 354\u2013362. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_30"},{"key":"17_CR25","unstructured":"Williams, V.V.: On some fine-grained questions in algorithms and complexity. In: Sirakov, B., de Souza, P.N., Viana, M. (eds.) Proceedings of the International Congress of Mathematicians, pp. 3447\u20133487. World Scientific, Rio de Janeiro, April 2018"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86593-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:31:42Z","timestamp":1631392302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86593-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865924","9783030865931"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86593-1_17","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":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"12 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 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":"fct2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/fct2021\/","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":"94","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":"30","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":"32% - 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":"8.54","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic. There are papers of 2 invited talks also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}