{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:10Z","timestamp":1759638610438,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319133492"},{"type":"electronic","value":"9783319133508"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-13350-8_6","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T07:46:18Z","timestamp":1418111178000},"page":"71-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages"],"prefix":"10.1007","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,10]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45526-4_1","volume-title":"Automata Implementation","author":"J Amilhastre","year":"2001","unstructured":"Amilhastre, J., Janssen, P., Vilarem, M.-C.: FA Minimisation Heuristics for a Class of Finite Languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol. 2214, p. 1. Springer, Heidelberg (2001)"},{"key":"6_CR2","unstructured":"Barnsley, M.F.: Fractals Everywhere, Academic Press Professional (1988)"},{"key":"6_CR3","unstructured":"Berstel, J., Morcrette, M.: Compact representation of patterns by finite automata. In: Gagalowicz, A. (Ed.) Pixim 1989: L\u2019Image Num\u00e9rique \u00e0 Paris, pp. 387\u2013402 (1989)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-45526-4_14","volume-title":"Automata Implementation","author":"M Seuring","year":"2001","unstructured":"Seuring, M., G\u00f6ssel, M.: A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol. 2214, p. 158. Springer, Heidelberg (2001)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chrobak, M.: Finite automata and unary languages, Theoretical Computer Science, 47, 149\u2013158 (1986); Errata: 302, 497\u2013498 (2003)","DOI":"10.1016\/0304-3975(86)90142-8"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(93)90031-I","volume":"41","author":"K \u010cul\u00edk II","year":"1993","unstructured":"\u010cul\u00edk II, K., Dube, S.: Rational and affine expressions for image description. Discrete Applied Mathematics 41(2), 85\u2013120 (1993)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1137\/S0097539791224893","volume":"23","author":"K \u010cul\u00edk II","year":"1994","unstructured":"\u010cul\u00edk II, K., Karhum\u00e4ki, J.: Finite automata computing real functions. SIAM Journal on Computing 23(4), 789\u2013814 (1994)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0097-8493(93)90079-O","volume":"17","author":"K \u010cul\u00edk II","year":"1993","unstructured":"\u010cul\u00edk II, K., Kari, J.: Image compression using weighted finite automata. Computers & Graphics 17(3), 305\u2013313 (1993)","journal-title":"Computers & Graphics"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/0306-4573(94)90010-8","volume":"30","author":"K \u010cul\u00edk II","year":"1994","unstructured":"\u010cul\u00edk II, K., Kari, J.: Image-data compression using edge-optimizing algorithm for WFA inference. Information Processing & Management 30(6), 829\u2013838 (1994)","journal-title":"Information Processing & Management"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1051\/ita\/1994283-403871","volume":"28","author":"D Derencourt","year":"1994","unstructured":"Derencourt, D., Karhum\u00e4ki, J., Latteux, M., Terlutte, A.: On continuous functions computed by finite automata. RAIRO Informatique Th\u00e9orique et Applications 28, 387\u2013404 (1994)","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"issue":"1\u20133","key":"6_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0304-3975(02)00403-6","volume":"295","author":"V Geffert","year":"2003","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theoretical Computer Science 295(1\u20133), 189\u2013203 (2003)","journal-title":"Theoretical Computer Science"},{"key":"6_CR12","unstructured":"Gruska, J.: Descriptional complexity of context-free languages. In: Mathematical Foundations of Computer Science (MFCS 1973 Strbsk\u00e9 Pleso, High Tatras, Czechoslovakia, 3\u20138 September), 71\u201383 (1973)"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1142\/S0129054108005838","volume":"19","author":"Y-S Han","year":"2008","unstructured":"Han, Y.-S., Salomaa, K.: State complexity of union and intersection of finite languages. International Journal of Foundations of Computer Science 19(3), 581\u2013595 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/11549345_47","volume-title":"Mathematical Foundations of Computer Science 2005","author":"CA Kapoutsis","year":"2005","unstructured":"Kapoutsis, C.A.: Removing Bidirectionality from Nondeterministic Finite Automata. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 544\u2013555. Springer, Heidelberg (2005)"},{"key":"6_CR15","unstructured":"Karhum\u00e4ki, J., Kari, J.: Finite automata, image manipulation and automatic real functions. In: Pin, J.-\u00c9. (Ed.) Handbook of Automata, European Mathematical Society, to appear"},{"issue":"2\u20133","key":"6_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0166-218X(02)00196-8","volume":"125","author":"J Karhum\u00e4ki","year":"2003","unstructured":"Karhum\u00e4ki, J., Plandowski, W., Rytter, W.: The complexity of compressing subsegments of images described by finite automata. Discrete Applied Mathematics 125(2\u20133), 235\u2013254 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-21341-0_6","volume-title":"Unconventional Computation","author":"J Karhum\u00e4ki","year":"2011","unstructured":"Karhum\u00e4ki, J., Sallinen, T.: Weighted Finite Automata: Computing with Different Topologies. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds.) UC 2011. LNCS, vol. 6714, pp. 14\u201333. Springer, Heidelberg (2011)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-22321-1_14","volume-title":"Developments in Language Theory","author":"Peter \u010cerno","year":"2011","unstructured":"\u010cerno, Peter, Mr\u00e1z, Franti\u0161ek: $$\\Delta $$-Clearing Restarting Automata and CFL. In: Mauri, Giancarlo, Leporati, Alberto (eds.) DLT 2011. LNCS, vol. 6795, pp. 153\u2013164. Springer, Heidelberg (2011)"},{"issue":"5","key":"6_CR19","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 16(5), 975\u2013984 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"6_CR20","first-page":"321","volume":"9","author":"OB Lupanov","year":"1963","unstructured":"Lupanov, O.B.: A comparison of two types of finite automata (in Russian). Problemy Kibernetiki 9, 321\u2013326 (1963)","journal-title":"Problemy Kibernetiki"},{"key":"6_CR21","unstructured":"Mandl, R.: Precise bounds associated with the subset construction on various classes of nondeterministic finite automata. In: 7th Princeton Conference on Information and System Sciences, 263\u2013267 (1973)"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1109\/T-C.1971.223108","volume":"20","author":"FR Moore","year":"1971","unstructured":"Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Transactions on Computers 20, 1211\u20131214 (1971)","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR23","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. Information and Computation 212, 15\u201336 (2012)","journal-title":"Information and Computation"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"issue":"3","key":"6_CR25","first-page":"177","volume":"2","author":"K Salomaa","year":"1997","unstructured":"Salomaa, K., Yu, S.: NFA to DFA transformation for finite languages over arbitrary alphabets. Journal of Automata, Languages and Combinatorics 2(3), 177\u2013186 (1997)","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Computing with New Resources"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13350-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T09:15:11Z","timestamp":1674897311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13350-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319133492","9783319133508"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13350-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}