{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:26Z","timestamp":1725491426756},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_19","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T05:32:31Z","timestamp":1155101551000},"page":"198-207","source":"Crossref","is-referenced-by-count":2,"title":["Structurally Unambiguous Finite Automata"],"prefix":"10.1007","author":[{"given":"Hing","family":"Leung","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Company, San Francisco (1979)"},{"key":"19_CR2","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":"19_CR3","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":"19_CR4","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. Autom. Lang. Comb.\u00a06, 453\u2013466 (2001)","journal-title":"J. Autom. Lang. Comb."},{"key":"19_CR5","first-page":"269","volume":"5","author":"M. Kappes","year":"2000","unstructured":"Kappes, M.: Descriptional complexity of deterministic finite automata with multiple initial states. J. Autom. Lang. Comb.\u00a05, 269\u2013278 (2000)","journal-title":"J. Autom. Lang. Comb."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","first-page":"171","volume-title":"STACS 86","author":"O. Ibarra","year":"1985","unstructured":"Ibarra, O., Ravikumar, B.: On sparseness, ambiguity and other decision problems for acceptors and transducers. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol.\u00a0210, pp. 171\u2013179. Springer, Heidelberg (1985)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539793252092","volume":"27","author":"H. Leung","year":"1988","unstructured":"Leung, H.: Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput.\u00a027, 1073\u20131082 (1988)","journal-title":"SIAM J. Comput."},{"key":"19_CR8","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. International Journal of Foundations of Computer Science\u00a016, 975\u2013984 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Fischer, M.: Economy of description by automata, grammars, and formal systems. In: IEEE Twelfth Annual Symposium on Switching and Automata Theory, pp. 188\u2013191 (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1137\/0218083","volume":"18","author":"B. Ravikumar","year":"1989","unstructured":"Ravikumar, B., Ibarra, O.: Relating the type of ambiguity of finite automata to the succinctness of their representation. SIAM J. Comput.\u00a018, 1263\u20131282 (1989)","journal-title":"SIAM J. Comput."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Schmidt, E.M.: Succinctness of descriptions of context-free, regular and finite languages, PhD Thesis, Cornell University, Ithaca, NY (1978)","DOI":"10.7146\/dpb.v7i84.6500"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R.E. Stearns","year":"1985","unstructured":"Stearns, R.E., Hunt, H.B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM J. Comput.\u00a014, 598\u2013611 (1985)","journal-title":"SIAM J. Comput."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/0022-0000(79)90038-2","volume":"18","author":"P.A.S. Veloso","year":"1979","unstructured":"Veloso, P.A.S., Gill, A.: Some remarks on multiple-entry finite automata. J. Comput. System. Sci.\u00a018, 304\u2013306 (1979)","journal-title":"J. Comput. System. Sci."},{"key":"19_CR14","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.\u00a088, 325\u2013349 (1991)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:13:58Z","timestamp":1605626038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11812128_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}