{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:49:45Z","timestamp":1764557385411,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_20","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"243-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Operations on Unambiguous Finite Automata"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"Jozef","family":"Jir\u00e1sek","sequence":"first","affiliation":[]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[]},{"given":"Juraj","family":"\u0160ebej","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1142\/S0129054111008477","volume":"22","author":"C Allauzen","year":"2011","unstructured":"Allauzen, C., Mohri, M., Rastogi, A.: General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers. Int. J. Found. Comput. Sci. 22(4), 883\u2013904 (2011). \n                    http:\/\/dx.doi.org\/10.1142\/S0129054111008477","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(93)90160-U","volume":"119","author":"J Birget","year":"1993","unstructured":"Birget, J.: Partial orders on words, minimal elements of regular languages and state complexity. Theor. Comput. Sci. 119(2), 267\u2013291 (1993). \n                    http:\/\/dx.doi.org\/10.1016\/0304-3975(93)90160-U","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"20_CR3","first-page":"303","volume":"7","author":"C C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. J. Autom. Lang. Comb. 7(3), 303\u2013310 (2002)","journal-title":"J. Autom. Lang. Comb."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-39310-5_26","volume-title":"Descriptional Complexity of Formal Systems","author":"K \u010cevorov\u00e1","year":"2013","unstructured":"\u010cevorov\u00e1, K.: Kleene star on unary regular languages. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 277\u2013288. Springer, Heidelberg (2013). \n                    http:\/\/dx.doi.org\/10.1007\/978-3-642-39310-5_26"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(88)90012-6","volume":"23","author":"T Chan","year":"1983","unstructured":"Chan, T., Ibarra, O.H.: On the finite-valuedness problem for sequential machines. Theor. Comput. Sci. 23, 95\u2013101 (1983). \n                    http:\/\/dx.doi.org\/10.1016\/0304-3975(88)90012-6","journal-title":"Theor. Comput. Sci."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-19225-3_1","volume-title":"Descriptional Complexity of Formal Systems","author":"T Colcombet","year":"2015","unstructured":"Colcombet, T.: Unambiguity in automata theory. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 3\u201318. Springer, Heidelberg (2015). \n                    http:\/\/dx.doi.org\/10.1007\/978-3-319-19225-3_1"},{"key":"20_CR7","unstructured":"Eli\u00e1\u0161, P.: Fooling sets for complements of UFAs. Unpublished manuscript (2016)"},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inf. Process. Lett. 59(2), 75\u201377 (1996). \n                    http:\/\/dx.doi.org\/10.1016\/0020-0190(96)00095-6","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"M Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14(6), 1087\u20131102 (2003). \n                    http:\/\/dx.doi.org\/10.1142\/S0129054103002199","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"20_CR10","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(3), 517\u2013534 (2011). \n                    http:\/\/dx.doi.org\/10.1007\/s00224-010-9277-4","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"20_CR11","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(2), 202\u2013217 (2002). \n                    http:\/\/dx.doi.org\/10.1006\/inco.2001.3069","journal-title":"Inf. Comput."},{"key":"20_CR12","series-title":"LNCS","first-page":"171","volume-title":"STACS 1986","author":"OH Ibarra","year":"1986","unstructured":"Ibarra, O.H., Ravikumar, B.: On sparseness, ambiguity and other decision problems for acceptors and transducers. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol. 210, pp. 171\u2013179. Springer, Heidelberg (1986). \n                    http:\/\/dx.doi.org\/10.1007\/3-540-16078-7_74"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.tcs.2004.04.011","volume":"330","author":"G Jir\u00e1skov\u00e1","year":"2005","unstructured":"Jir\u00e1skov\u00e1, G.: State complexity of some operations on binary regular languages. Theor. Comput. Sci. 330(2), 287\u2013298 (2005). \n                    http:\/\/dx.doi.org\/10.1016\/j.tcs.2004.04.011","journal-title":"Theor. Comput. Sci."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"EL Leiss","year":"1981","unstructured":"Leiss, E.L.: Succint representation of regular languages by boolean automata. Theor. Comput. Sci. 13, 323\u2013330 (1981). \n                    http:\/\/dx.doi.org\/10.1016\/S0304-3975(81)80005-9","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"20_CR15","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(4), 1073\u20131082 (1998). \n                    http:\/\/dx.doi.org\/10.1137\/S0097539793252092","journal-title":"SIAM J. Comput."},{"issue":"5","key":"20_CR16","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. 16(5), 975\u2013984 (2005). \n                    http:\/\/dx.doi.org\/10.1142\/S0129054105003418","journal-title":"Int. J. Found. Comput. Sci."},{"key":"20_CR17","first-page":"328","volume":"6","author":"OB Lupanov","year":"1966","unstructured":"Lupanov, O.B.: A comparison of two types of finite automata. Problemy Kibernetiki 9, Kibernetiki (1963), (in Russian) German translation: \u00dcber den Vergleich zweier Typen endlicher Quellen. Probleme der. Kybernetik 6, 328\u2013335 (1966)","journal-title":"Kybernetik"},{"key":"20_CR18","first-page":"1373","volume":"11","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Doklady 11, 1373\u2013375 (1970)","journal-title":"Soviet Math. Doklady"},{"key":"20_CR19","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. 212, 15\u201336 (2012). \n                    http:\/\/dx.doi.org\/10.1016\/j.ic.2012.01.003","journal-title":"Inf. Comput."},{"issue":"6","key":"20_CR20","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). \n                    http:\/\/dx.doi.org\/10.1137\/0218083","journal-title":"SIAM J. Comput."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Schmidt, E.M.: Succinctness of description of context-free, regular, and finite languages. Ph. D. thesis. Cornell University (1978)","DOI":"10.7146\/dpb.v7i84.6500"},{"key":"20_CR22","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company, Boston (1997)"},{"issue":"3","key":"20_CR23","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"RE 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. 14(3), 598\u2013611 (1985). \n                    http:\/\/dx.doi.org\/10.1137\/0214044","journal-title":"SIAM J. Comput."},{"issue":"2","key":"20_CR24","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). \n                    http:\/\/dx.doi.org\/10.1016\/0304-3975(91)90381-B","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theor. Comput. Sci. 125(2), 315\u2013328 (1994). \n                    http:\/\/dx.doi.org\/10.1016\/0304-3975(92)00011-F","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T11:14:28Z","timestamp":1580296468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montr\u00e9al","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":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}