{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T02:03:42Z","timestamp":1794449022341,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642393099","type":"print"},{"value":"9783642393105","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39310-5_21","type":"book-chapter","created":{"date-parts":[[2013,6,13]],"date-time":"2013-06-13T21:33:15Z","timestamp":1371159195000},"page":"217-228","source":"Crossref","is-referenced-by-count":6,"title":["Comparisons between Measures of Nondeterminism on Finite Automata"],"prefix":"10.1007","author":[{"given":"Alexandros","family":"Palioudakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Selim G.","family":"Akl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","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. UCS\u00a08(2), 193\u2013234 (2002)","journal-title":"J. UCS"},{"issue":"2","key":"21_CR2","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.\u00a086(2), 179\u2013194 (1990)","journal-title":"Inf. Comput."},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0890-5401(92)90014-7","volume":"100","author":"J. Goldstine","year":"1992","unstructured":"Goldstine, J., Leung, H., Wotschke, D.: On the relation between ambiguity and nondeterminism in finite automata. Inf. Comput.\u00a0100(2), 261\u2013270 (1992)","journal-title":"Inf. Comput."},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15349-5_1","volume-title":"Reachability Problems","author":"M. Holzer","year":"2010","unstructured":"Holzer, M., Kutrib, M.: Descriptional complexity of (un)ambiguous finite state machines and pushdown automata. In: Ku\u010dera, A., Potapov, I. (eds.) RP 2010. LNCS, vol.\u00a06227, pp. 1\u201323. Springer, Heidelberg (2010)"},{"issue":"3","key":"21_CR5","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.\u00a0209(3), 456\u2013470 (2011)","journal-title":"Inf. Comput."},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-45022-X_17","volume-title":"Automata, Languages and Programming","author":"J. Hromkovi\u010d","year":"2000","unstructured":"Hromkovi\u010d, J., Karhum\u00e4ki, J., Klauck, H., Schnitger, G., Seibert, S.: Measures of nondeterminism in finite automata. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 199\u2013210. Springer, Heidelberg (2000)"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/inco.2001.3069","volume":"172","author":"J. Hromkovic","year":"2002","unstructured":"Hromkovic, J., Seibert, S., Karhum\u00e4ki, J., Klauck, H., Schnitger, G.: Communication complexity method for measuring nondeterminism in finite automata. Inf. Comput.\u00a0172(2), 202\u2013217 (2002)","journal-title":"Inf. Comput."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF00263994","volume":"13","author":"C.M.R. Kintala","year":"1980","unstructured":"Kintala, C.M.R., Wotschke, D.: Amounts of nondeterminism in finite automata. Acta Inf.\u00a013, 199\u2013204 (1980)","journal-title":"Acta Inf."},{"issue":"7","key":"21_CR9","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.\u00a035(7), 595\u2013624 (1998)","journal-title":"Acta Inf."},{"issue":"4","key":"21_CR10","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.\u00a027(4), 1073\u20131082 (1998)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"21_CR11","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1142\/S0129054105003418","volume":"16","author":"H. Leung","year":"2005","unstructured":"Leung, H.: Descriptional complexity of NFA of different ambiguity. Int. J. Found. Comput. Sci.\u00a016(5), 975\u2013984 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ic.2012.01.003","volume":"212","author":"A. Okhotin","year":"2012","unstructured":"Okhotin, A.: Unambiguous finite automata over a unary alphabet. Inf. Comput.\u00a0212, 15\u201336 (2012)","journal-title":"Inf. Comput."},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-31623-4_20","volume-title":"Descriptional Complexity of Formal Systems","author":"A. Palioudakis","year":"2012","unstructured":"Palioudakis, A., Salomaa, K., Akl, S.G.: State complexity and limited nondeterminism. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol.\u00a07386, pp. 252\u2013265. Springer, Heidelberg (2012); A full version of the paper is accepted for publication in JALC"},{"issue":"6","key":"21_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.\u00a018(6), 1263\u20131282 (1989)","journal-title":"SIAM J. Comput."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Shallit, J.O.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511808876"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular Languages. In: Handbook of Formal Languages, vol.\u00a01, 41\u2013110. Springer (1998)","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39310-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T23:49:20Z","timestamp":1557791360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_21","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}