{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T07:29:21Z","timestamp":1771745361757,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031343254","type":"print"},{"value":"9783031343261","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34326-1_4","type":"book-chapter","created":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:04:23Z","timestamp":1687604663000},"page":"51-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Existential and\u00a0Universal Width of\u00a0Alternating Finite Automata"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungmin","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Ki","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,24]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/00207169008803893","volume":"35","author":"A Fellah","year":"1990","unstructured":"Fellah, A., J\u00fcrgensen, H., Yu, S.: Constructions for alternating finite automata. Int. J. Comput. Math. 35, 117\u2013132 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.044","volume":"445","author":"V Geffert","year":"2012","unstructured":"Geffert, V.: An alternating hierarchy for finite automata. Theor. Comput. Sci. 445, 1\u201324 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR4","first-page":"193","volume":"8","author":"J Goldstine","year":"2002","unstructured":"Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. Univ. Comput. Sci. 8(2), 193\u2013234 (2002)","journal-title":"J. Univ. Comput. Sci."},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0890-5401(90)90053-K","volume":"86","author":"J Goldstine","year":"1990","unstructured":"Goldstine, J., Kintala, C.M.R., Wotschke, D.: On measuring nondeterminism in regular languages. Inf. Comput. 86(2), 179\u2013194 (1990)","journal-title":"Inf. Comput."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.tcs.2022.10.023","volume":"939","author":"YS Han","year":"2023","unstructured":"Han, Y.S., Ko, S.K., Salomaa, K.: Deciding path size of nondeterministic (and input-driven) pushdown automata. Theor. Comput. Sci. 939, 170\u2013181 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.14232\/actacyb.23.1.2017.9","volume":"23","author":"YS Han","year":"2017","unstructured":"Han, Y.S., Salomaa, A., Salomaa, K.: Ambiguity, nondeterminism and state complexity of finite automata. Acta Cybernetica 23, 141\u2013157 (2017)","journal-title":"Acta Cybernetica"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K Hashiguchi","year":"1982","unstructured":"Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. J. Comput. Syst. Sci. 24, 223\u2013244 (1982)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","volume":"209","author":"M Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata: a survey. Inf. Comput. 209(3), 456\u2013470 (2011)","journal-title":"Inf. Comput."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/0022-0000(85)90063-7","volume":"31","author":"J Hromkovi\u010d","year":"1985","unstructured":"Hromkovi\u010d, J.: On the power of alternation in automata theory. J. Comput. Syst. Sci. 31, 28\u201339 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s00224-010-9277-4","volume":"48","author":"J Hromkovi\u010d","year":"2011","unstructured":"Hromkovi\u010d, J., Schnitger, G.: Ambiguity and communication. Theory Comput. Syst. 48, 517\u2013534 (2011)","journal-title":"Theory Comput. Syst."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/inco.2001.3069","volume":"172","author":"J Hromkovi\u010d","year":"2002","unstructured":"Hromkovi\u010d, J., Seibert, S., Karhum\u00e4ki, J., Klauck, H., Schnitger, G.: Communication complexity method for measuring nondeterminism in finite automata. Inf. Comput. 172, 202\u2013217 (2002)","journal-title":"Inf. Comput."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2020.12.011","volume":"870","author":"C Kapoutsis","year":"2021","unstructured":"Kapoutsis, C., Zakzok, M.: Alternation in two-way finite automata. Theor. Comput. Sci. 870, 75\u2013102 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-030-40608-0_13","volume-title":"Language and Automata Theory and Applications","author":"C Keeler","year":"2020","unstructured":"Keeler, C., Salomaa, K.: Alternating finite automata with limited universal branching. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2020. LNCS, vol. 12038, pp. 196\u2013207. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40608-0_13"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-030-62536-8_8","volume-title":"Descriptional Complexity of Formal Systems","author":"C Keeler","year":"2020","unstructured":"Keeler, C., Salomaa, K.: Combining limited parallelism and nondeterminism in alternating finite automata. In: Jir\u00e1skov\u00e1, G., Pighizzini, G. (eds.) DCFS 2020. LNCS, vol. 12442, pp. 91\u2013103. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62536-8_8"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Keeler, C., Salomaa, K.: Width measures of alternating finite automata. In: International Conference Descriptional Complexity of Formal Systems, DCFS. Lecture Notes in Computer Science, vol. 13037, pp. 88\u201399. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-93489-7_8","DOI":"10.1007\/978-3-030-93489-7_8"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Keeler, C., Salomaa, K.: Structural properties of NFAs and growth rates of nondeterminism measures. Inf. Comput. 284, 104690 (2022)","DOI":"10.1016\/j.ic.2021.104690"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: Proceedings of 18th Annual Symposium on Foundations of Computer Science, pp. 254\u2013266 (1977)","DOI":"10.1109\/SFCS.1977.16"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E Leiss","year":"1981","unstructured":"Leiss, E.: Succinct representation of regular languages by Boolean automata. Theor. Comput. Sci. 13, 323\u2013330 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(91)90321-R","volume":"81","author":"H Leung","year":"1991","unstructured":"Leung, H.: Limitedness theorem on finite automata with distance functions: an algebraic proof. Theor. Comput. Sci. 81, 137\u2013145 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s002360050133","volume":"35","author":"H Leung","year":"1998","unstructured":"Leung, H.: On finite automata with limited nondeterminism. Acta Informatica 35, 595\u2013624 (1998)","journal-title":"Acta Informatica"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539793252092","volume":"27","author":"H Leung","year":"1998","unstructured":"Leung, H.: Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27, 1073\u20131082 (1998)","journal-title":"SIAM J. Comput."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-3975(03)00377-3","volume":"310","author":"H Leung","year":"2004","unstructured":"Leung, H., Podolskiy, V.: The limitedness problem on distance automata: Hashiguchi\u2019s method revisited. Theor. Comput. Sci. 310, 147\u2013158 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20134","key":"4_CR24","first-page":"245","volume":"17","author":"A Palioudakis","year":"2012","unstructured":"Palioudakis, A., Salomaa, K., Akl, S.G.: State complexity of finite tree width NFAs. J. Automata Lang. Comb. 17(2\u20134), 245\u2013264 (2012)","journal-title":"J. Automata Lang. Comb."},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1142\/S0129054117500137","volume":"28","author":"A Palioudakis","year":"2017","unstructured":"Palioudakis, A., Salomaa, K., Akl, S.G.: Worst case branching and other measures of nondeterminism. Int. J. Found. Comput. Sci. 28(3), 195\u2013210 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"4_CR26","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1137\/0218083","volume":"18","author":"B Ravikumar","year":"1989","unstructured":"Ravikumar, B., Ibarra, O.H.: Relating the type of ambiguity of finite automata to the succinctness of their representation. SIAM J. Comput. 18(6), 1263\u20131282 (1989)","journal-title":"SIAM J. Comput."},{"key":"4_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J Shallit","year":"2008","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2008)"},{"key":"4_CR28","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Cengage (2013)"},{"issue":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(91)90381-B","volume":"88","author":"A Weber","year":"1991","unstructured":"Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. Theor. Comput. Sci. 88(2), 325\u2013349 (1991)","journal-title":"Theor. Comput. Sci."}],"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-34326-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:05:11Z","timestamp":1687604711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34326-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343254","9783031343261"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34326-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 June 2023","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":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.uni-potsdam.de\/dcfs2023\/","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":"16","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":"88% - 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.35","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)"}}]}}