{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:26Z","timestamp":1759638326930,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031132568"},{"type":"electronic","value":"9783031132575"}],"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-13257-5_6","type":"book-chapter","created":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T23:02:52Z","timestamp":1661122972000},"page":"72-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["State Complexity of Binary Coded Regular Languages"],"prefix":"10.1007","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominika","family":"Pali\u0161\u00ednov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Szabari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"key":"6_CR1","volume-title":"Codes and Automata","author":"J Berstel","year":"2010","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2010)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J-C Birget","year":"1992","unstructured":"Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185\u2013190 (1992)","journal-title":"Inform. Process. Lett."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(91)90260-9","volume":"84","author":"V Bruy\u00e8re","year":"1991","unstructured":"Bruy\u00e8re, V.: Maximal codes with bounded deciphering delay. Theoret. Comput. Sci. 84, 53\u201376 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-39310-5_26","volume-title":"Descriptional Complexity of Formal Systems","author":"K \u010cevorov\u00e1","year":"2013","unstructured":"\u010cevorov\u00e1, K.: Kleene star on unary regular languages. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 277\u2013288. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39310-5_26"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1016\/j.ic.2007.07.001","volume":"205","author":"V Geffert","year":"2007","unstructured":"Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inform. Comput. 205, 1652\u20131670 (2007)","journal-title":"Inform. Comput."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11685654_12","volume-title":"Theoretical Computer Science","author":"O Goldreich","year":"2006","unstructured":"Goldreich, O.: On promise problems: a survey. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol. 3895, pp. 254\u2013290. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11685654_12"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-030-79121-6_8","volume-title":"Implementation and Application of Automata","author":"M Holzer","year":"2021","unstructured":"Holzer, M., Rauch, C.: The range of state complexities of languages resulting from the cascade product\u2014the unary case (extended abstract). In: Maneth, S. (ed.) CIAA 2021. LNCS, vol. 12803, pp. 90\u2013101. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79121-6_8"},{"key":"6_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"2001","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (2001)"},{"key":"6_CR9","unstructured":"Hricko, M., Jir\u00e1skov\u00e1, G., Szabari, A.: Union and intersection of regular languages and descriptional complexity. In: Proceedings of Descriptional Complexity of Formal Systems, pp. 170\u2013181. IFIP & University, Milano (2005)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0304-3975(00)00029-3","volume":"237","author":"K Iwama","year":"2000","unstructured":"Iwama, K., Kambayashi, Y., Takaki, K.: Tight bounds on the number of states of DFA\u2019s that are equivalent to $$n$$-state NFA\u2019s. Theoret. Comput. Sci. 237, 485\u2013494 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1142\/S0129054111008076","volume":"22","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G.: Magic numbers and ternary alphabet. Internat. J. Found. Comput. Sci. 22, 331\u2013344 (2011)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2012.04.009","volume":"449","author":"G Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: On a structural property in the state complexity of projected regular languages. Theoret. Comput. Sci. 449, 93\u2013105 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.tcs.2016.05.002","volume":"658","author":"N Moreira","year":"2017","unstructured":"Moreira, N., Pighizzini, G., Reis, R.: Optimal state reductions of automata with partially specified behaviors. Theoret. Comput. Sci. 658, 235\u2013245 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1109\/TEC.1959.5222697","volume":"3","author":"MC Paull","year":"1959","unstructured":"Paull, M.C., Unger, S.H.: Minimizing the number of states in incompletely specified sequential switching functions. IRE Trans. Electron. Comput. 3, 356\u2013367 (1959)","journal-title":"IRE Trans. Electron. Comput."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/T-C.1973.223655","volume":"C\u201322","author":"CP Pfleeger","year":"1973","unstructured":"Pfleeger, C.P.: State reduction in incompletely specified finite-state machines. IEEE Trans. Comput. C\u201322, 1099\u20131102 (1973)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3, 114\u2013125 (1959)","journal-title":"IBM J. Res. Develop."}],"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-031-13257-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T23:03:43Z","timestamp":1661123023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13257-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031132568","9783031132575"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13257-5_6","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":"22 August 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":"Debrecen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","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":"29 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/konferencia.unideb.hu\/en\/dcfs-2022","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":"17","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":"14","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":"82% - 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.3","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)"}}]}}