{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:29:27Z","timestamp":1762507767746,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030232467"},{"type":"electronic","value":"9783030232474"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23247-4_3","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"46-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Union-Freeness, Deterministic Union-Freeness and Union-Complexity"],"prefix":"10.1007","author":[{"given":"Benedek","family":"Nagy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-00982-2_7","volume-title":"Language and Automata Theory and Applications","author":"S Afonin","year":"2009","unstructured":"Afonin, S., Golomazov, D.: Minimal union-free decompositions of regular languages. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 83\u201392. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00982-2_7"},{"unstructured":"Brzozowski, J.A.: Regular expression techniques for sequential circuits. Ph.D. Dissertation, Department of Electrical Engineering, Princeton University, Princeton, June 1962","key":"3_CR2"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-94631-3_4","volume-title":"Descriptional Complexity of Formal Systems","author":"JA Brzozowski","year":"2018","unstructured":"Brzozowski, J.A., Davies, S.: Most complex deterministic union-free regular languages. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 37\u201348. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94631-3_4"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1006\/inco.2000.2889","volume":"164","author":"S Crvenkovi\u0107","year":"2001","unstructured":"Crvenkovi\u0107, S., Dolinka, I., \u00c9sik, Z.: On equations for union-free regular languages. Inf. Comput. 164(1), 152\u2013172 (2001). https:\/\/doi.org\/10.1006\/inco.2000.2889","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M.: Structure and complexity of some subregular language families. In: Konstantinidis, S., Moreira, N., Reis, R., Shallit, J. (eds.) The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski, pp. 59\u201382. World Scientific (2017). https:\/\/doi.org\/10.1142\/9789813148208_0003","key":"3_CR5","DOI":"10.1142\/9789813148208_0003"},{"key":"3_CR6","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, Reading (1979)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1142\/S0129054111008933","volume":"22","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: Complexity in union-free regular languages. Int. J. Found. Comput. Sci. 22, 1639\u20131653 (2011). https:\/\/doi.org\/10.1142\/S0129054111008933","journal-title":"Int. J. Found. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Jir\u00e1skov\u00e1, G., Nagy, B.: On union-free and deterministic union-free languages. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 179\u2013192. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33475-7_13","key":"3_CR8","DOI":"10.1007\/978-3-642-33475-7_13"},{"issue":"2\u20133\u20134","key":"3_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1051\/ita\/2018014","volume":"52","author":"M Kutrib","year":"2018","unstructured":"Kutrib, M., Wendlandt, M.: Expressive capacity of subregular expressions. RAIRO ITA Theor. Inform. Appl. 52(2\u20133\u20134), 201\u2013218 (2018). https:\/\/doi.org\/10.1051\/ita\/2018014","journal-title":"RAIRO ITA Theor. Inform. Appl."},{"unstructured":"Nagy, B.: A normal form for regular expressions. In: Calude, C., Calude, E., Dinnen, M.J. (eds.) Supplemental Papers for DLT 2004, pp. 51\u201360. CDMTCS Report 252, Auckland (2004)","key":"3_CR10"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.5486\/PMD.2006.3303","volume":"68","author":"B Nagy","year":"2006","unstructured":"Nagy, B.: Union-free regular languages and 1-cycle-free-path-automata. Publ. Math. Debrecen 68, 183\u2013197 (2006)","journal-title":"Publ. Math. Debrecen"},{"doi-asserted-by":"crossref","unstructured":"Nagy, B.: On union-complexity of regular languages. In: Proceedings of the 11th IEEE International Symposium on Computational Intelligence and Informatics, pp. 177\u2013182 (2010)","key":"3_CR12","DOI":"10.1109\/CINTI.2010.5672252"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 41\u2013100. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_2"}],"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-23247-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:50:37Z","timestamp":1739343037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","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":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/dcfs2019\/","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":"25","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":"18","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":"72% - 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":"2,9","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":"there are also 4 invited talks","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)"}}]}}