{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:11:00Z","timestamp":1725491460477},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_25","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T03:58:11Z","timestamp":1189569491000},"page":"254-265","source":"Crossref","is-referenced-by-count":4,"title":["Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet"],"prefix":"10.1007","author":[{"given":"Jozef","family":"Jir\u00e1sek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Szabari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","first-page":"419","volume":"7","author":"H.N. Adorna","year":"2002","unstructured":"Adorna, H.N.: 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. J. Autom. Lang. Comb.\u00a07, 419\u2013432 (2002)","journal-title":"J. Autom. Lang. Comb."},{"key":"25_CR2","first-page":"133","volume-title":"Proc.15th ACM STOC","author":"A.V. Aho","year":"1983","unstructured":"Aho, A.V., Ullman, J.D., Yannakakis, M.: On notions of informations transfer in VLSI circuits. In: Proc.15th ACM STOC, pp. 133\u2013139. ACM, New York (1983)"},{"unstructured":"Berman, P., Lingas, A.: On the complexity of regular languages in terms of finite automata. Technical Report 304, Polish Academy of Sciences (1977)","key":"25_CR3"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"185","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, 185\u2013190 (1992)","journal-title":"Inform. Process. Lett."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(93)90160-U","volume":"119","author":"J.C. Birget","year":"1993","unstructured":"Birget, J.C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci.\u00a0119, 267\u2013291 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci.\u00a047, 149\u2013158 (1986)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Geffert, V. (Non)determinism and the size of one-way finite automata. In: Proc. 7th DCFS, Como, Italy, pp. 23\u201337 ( 2006)","key":"25_CR7"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/11821069_36","volume-title":"Mathematical Foundations of Computer Science 2006","author":"V. Geffert","year":"2006","unstructured":"Geffert, V.: Magic numbers in the state hierarchy of finite automata. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 412\u2013423. Springer, Heidelberg (2006)"},{"key":"25_CR9","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. Inform. Process. Lett.\u00a059, 75\u201377 (1996)","journal-title":"Inform. Process. Lett."},{"key":"25_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03442-2","volume-title":"Communication Complexity and Parallel Computing","author":"J. Hromkovi\u010d","year":"1997","unstructured":"Hromkovi\u010d, J.: Communication Complexity and Parallel Computing. Springer-Verlag, Berlin, Heidelberg (1997)"},{"key":"25_CR11","first-page":"519","volume":"7","author":"J. Hromkovi\u010d","year":"2002","unstructured":"Hromkovi\u010d, J.: Descriptional complexity of finite automata: concepts and open problems. J.\u00a0Autom. Lang. Comb.\u00a07, 519\u2013531 (2002)","journal-title":"J.\u00a0Autom. Lang. Comb."},{"key":"25_CR12","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. and Comput.\u00a0172, 202\u2013217 (2002)","journal-title":"Inform. and Comput."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0304-3975(00)00029-3","volume":"237","author":"K. Iwama","year":"2000","unstructured":"Iwama, K., Kambayashi, Y., Takaki, K.: Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. Theoret. Comput. Sci.\u00a0237, 485\u2013494 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00891-5","volume":"301","author":"K. Iwama","year":"2003","unstructured":"Iwama, K., Matsuura, A., Paterson, M.: A family of NFAs which need 2\n                    n\n                  \u2009\u2212\u2009\u03b1 deterministic states. Theoret. Comput. Sci.\u00a0301, 451\u2013462 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-44683-4_37","volume-title":"Mathematical Foundations of Computer Science 2001","author":"G. Jir\u00e1skov\u00e1","year":"2001","unstructured":"Jir\u00e1skov\u00e1, G.: Note on minimal finite automata. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 421\u2013431. Springer, Heidelberg (2001)"},{"key":"25_CR16","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. Theoret. Comput. Sci.\u00a0330, 287\u2013298 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR17","first-page":"321","volume":"9","author":"O.B. Lupanov","year":"1963","unstructured":"Lupanov, O.B.: A comparison of two types of finite automata. Problemy Kibernetiki\u00a09, 321\u2013326 (in Russian) (1963)","journal-title":"Problemy Kibernetiki"},{"key":"25_CR18","first-page":"337","volume":"5","author":"Y..I. Lyubich","year":"1964","unstructured":"Lyubich, Y.I.: Estimates for optimal determinization of nondeterministic autonomous automata. Sibirskii Matematichskii Zhurnal\u00a05, 337\u2013355 (in Russian) (1964)","journal-title":"Sibirskii Matematichskii Zhurnal"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1109\/T-C.1971.223108","volume":"20","author":"F.R. 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 Trans. Comput.\u00a020, 1211\u20131214 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Res. Develop.\u00a03, 114\u2013129 (1959)","journal-title":"IBM Res. Develop."},{"doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proc. 10th Annual ACM Symp. on Theory of Computing, pp. 275\u2013286 (1978)","key":"25_CR21","DOI":"10.1145\/800133.804357"},{"key":"25_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)"},{"key":"25_CR23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, ch. 2, pp. 41\u2013110. Springer-Verlag, Berlin Heidelberg (1997)"},{"key":"25_CR24","first-page":"270","volume":"72","author":"S. Yu","year":"2000","unstructured":"Yu, S.: A renaissance of automata theory? Bull. Eur. Assoc. Theor. Comput. Sci. EATCS\u00a072, 270\u2013272 (2000)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"}],"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-540-73208-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T21:34:08Z","timestamp":1558474448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}