{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:59:29Z","timestamp":1725796769812},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319097039"},{"type":"electronic","value":"9783319097046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09704-6_14","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T09:43:21Z","timestamp":1405071801000},"page":"150-161","source":"Crossref","is-referenced-by-count":0,"title":["Computation Width and Deviation Number"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Go\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"85","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.\u00a043, 85\u201390 (1992)","journal-title":"Inform. Process. Lett."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.jcss.2011.03.001","volume":"78","author":"H. Bj\u00f6rklund","year":"2012","unstructured":"Bj\u00f6rklund, H., Martens, W.: The tractability frontier for NFA minimization. J. Comput. System Sci.\u00a078, 198\u2013210 (2012)","journal-title":"J. Comput. System Sci."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-0000(74)80034-6","volume":"9","author":"A. Gill","year":"1974","unstructured":"Gill, A., Kou, L.T.: Multiple-entry finite automata. J. Comput. System. Sci.\u00a09, 1\u201319 (1974)","journal-title":"J. Comput. System. Sci."},{"key":"14_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.\u00a08, 193\u2013234 (2002)","journal-title":"J. Univ. Comput. Sci."},{"key":"14_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. Inform. Comput.\u00a086, 179\u2013194 (1990)","journal-title":"Inform. Comput."},{"key":"14_CR6","first-page":"453","volume":"6","author":"M. Holzer","year":"2001","unstructured":"Holzer, M., Salomaa, K., Yu, S.: On the state complexity of k-entry deterministic finite automata. J. Automata, Languages, and Combinatorics\u00a06, 453\u2013466 (2001)","journal-title":"J. Automata, Languages, and Combinatorics"},{"key":"14_CR7","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. Inform. Comput.\u00a0172, 202\u2013217 (2002)","journal-title":"Inform. Comput."},{"key":"14_CR8","first-page":"70","volume":"111","author":"M. Kutrib","year":"2013","unstructured":"Kutrib, M., Pighizzini, G.: Recent trends in descriptional complexity of formal languages. Bulletin of the EATCS\u00a0111, 70\u201386 (2013)","journal-title":"Bulletin of the EATCS"},{"key":"14_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, 595\u2013624 (1998)","journal-title":"Acta Inf."},{"issue":"4","key":"14_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":"2\u20134","key":"14_CR11","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. Journal of Automata, Languages and Combinatorics\u00a017(2\u20134), 245\u2013264 (2012)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-39310-5_21","volume-title":"Descriptional Complexity of Formal Systems","author":"A. Palioudakis","year":"2013","unstructured":"Palioudakis, A., Salomaa, K., Akl, S.G.: Comparisons between measures of nondeterminism on finite automata. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol.\u00a08031, pp. 217\u2013228. Springer, Heidelberg (2013)"},{"key":"14_CR13","unstructured":"Palioudakis, A., Salomaa, K., Akl, S.G.: Lower bound for converting an NFA with finite nondeterminism in an MDFA. J. Automata, Languages, and Combinatorics (accepted for publication March 2014)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511808876"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 41\u2013110. Springer (1997)","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-319-09704-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T08:31:11Z","timestamp":1558945871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09704-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319097039","9783319097046"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}