{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T08:05:33Z","timestamp":1784189133855,"version":"3.55.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032320155","type":"print"},{"value":"9783032320162","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T00:00:00Z","timestamp":1784246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T00:00:00Z","timestamp":1784246400000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-32016-2_2","type":"book-chapter","created":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T07:25:46Z","timestamp":1784186746000},"page":"16-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Largest Finite Optimal Existential and\u00a0Universal Widths of\u00a0Unary AFAs"],"prefix":"10.1007","author":[{"given":"John","family":"Alajaji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,17]]},"reference":[{"issue":"1","key":"2_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). https:\/\/doi.org\/10.1145\/322234.322243","journal-title":"J. ACM"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47, 149\u2013158 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90142-8","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Goldstine, J., Kintala, C.M.R., Wotschke, D.: On measuring nondeterminism in regular languages. Inf. Comput. 86(2), 179\u2013194 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90053-K","DOI":"10.1016\/0890-5401(90)90053-K"},{"key":"2_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2025.105337","volume":"306","author":"YS Han","year":"2025","unstructured":"Han, Y.S., Kim, S., Ko, S.K., Salomaa, K.: Existential and universal width of alternating finite automata. Inf. Comput. 306, 105337 (2025). https:\/\/doi.org\/10.1016\/j.ic.2025.105337","journal-title":"Inf. Comput."},{"key":"2_CR6","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). https:\/\/doi.org\/10.1006\/inco.2001.3069","journal-title":"Inf. Comput."},{"key":"2_CR7","unstructured":"Keeler, C.: Finite Automata with Restricted Nondeterminism and Universality, Queen\u2019s University. Ph.D. thesis (2021)"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Keeler, C., Salomaa, K.: Combining limited parallelism and nondeterminism in alternating finite automata. In: International Conference Descriptional Complexity of Formal Systems, DCFS. Lecture Notes in Computer Science, vol. 12442, pp. 91\u2013103. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62536-8_8","DOI":"10.1007\/978-3-030-62536-8_8"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Keeler, C., Salomaa, K.: Maximal existential and universal width. Sci. Ann. Comput. Sci. 33(1), 53\u201377 (2023). https:\/\/doi.org\/10.7561\/SACS.2023.1.53","DOI":"10.7561\/SACS.2023.1.53"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF00263994","volume":"13","author":"CM Kintala","year":"1980","unstructured":"Kintala, C.M., Wotschke, D.: Amounts of nondeterminism in finite automata. Acta Inf. 13, 199\u2013204 (1980). https:\/\/doi.org\/10.1007\/BF00263994","journal-title":"Acta Inf."},{"issue":"7","key":"2_CR11","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 Inf. 35(7), 595\u2013624 (1998). https:\/\/doi.org\/10.1007\/s002360050133","journal-title":"Acta Inf."},{"key":"2_CR12","unstructured":"Palioudakis, A., Salomaa, K., Akl, S.G.: State complexity of finite tree width NFAs. J. Automata Lang. Comb. 17(2-4), 245\u2013274 (2012). https:\/\/dl.acm.org\/doi\/10.5555\/3173440.3173451"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Ram\u00edrez\u00a0Alfons\u00edn, J.L.: The Diophantine Frobenius Problem. Oxford University Press (2005). https:\/\/doi.org\/10.1093\/acprof:oso\/9780198568209.001.0001","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001"},{"issue":"6","key":"2_CR14","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). https:\/\/doi.org\/10.1137\/0218083","journal-title":"SIAM J. Comput."},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2008). https:\/\/doi.org\/10.1017\/CBO9780511808876","DOI":"10.1017\/CBO9780511808876"},{"key":"2_CR16","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2013","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Cengage Learning, Boston (2013)","edition":"3"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Yu, S.: Beyond words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, chap. Regular Languages, pp. 41\u2013110. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6","DOI":"10.1007\/978-3-642-59126-6"}],"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-032-32016-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T07:25:48Z","timestamp":1784186748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32016-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,17]]},"ISBN":["9783032320155","9783032320162"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32016-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,17]]},"assertion":[{"value":"17 July 2026","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":"Kingston, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/research.cs.queensu.ca\/dcfs2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}