{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:20:20Z","timestamp":1726410020427},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_3","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T01:23:54Z","timestamp":1220923434000},"page":"34-55","source":"Crossref","is-referenced-by-count":0,"title":["On the Hardness of Determining Small NFA\u2019s and of Proving Lower Bounds on Their Sizes"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","volume-title":"Algorithmic Number Theory 1","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory 1. MIT Press, Cambridge (1996)"},{"issue":"3","key":"3_CR2","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. Theor. Comput. Sci.\u00a047(3), 149\u2013158 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0022-0000(03)00036-9","volume":"66","author":"V. Geffert","year":"2003","unstructured":"Geffert, V.: Translation of binary regular expressions into nondeterministic \u03b5-free automata with O(n logn) transitions. J. Comput. Syst. Sci.\u00a066, 451\u2013472 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Gramlich, G.: Probabilistic and nondeterministic unary automata. In: Proc. of 28th MFCS, pp. 460\u2013469 (2003)","DOI":"10.1007\/978-3-540-45138-9_40"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/j.jcss.2006.11.002","volume":"73","author":"G. Gramlich","year":"2007","unstructured":"Gramlich, G., Schnitger, G.: Minimizing nfa\u2019s and regular expressions. J. Comput. Syst. Sci.\u00a073, 909\u2013923 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-73208-2_21","volume-title":"Developments in Language Theory","author":"H. Gruber","year":"2007","unstructured":"Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P $\\not=$ NP. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 205\u2013216. Springer, Heidelberg (2007)"},{"key":"3_CR7","unstructured":"Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: Proc. 1st LATA, pp. 261\u2013272 (2007)"},{"issue":"2","key":"3_CR8","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., Karhum\u00e4ki, J., Klauck, H., Seibert, S., Schnitger, G.: Communication Complexity method for measuring nondeterminism in finite automata. Inf. Comput.\u00a0172(2), 202\u2013217 (2002)","journal-title":"Inf. Comput."},{"issue":"1-2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2007.02.063","volume":"380","author":"J. Hromkovi\u010d","year":"2007","unstructured":"Hromkovi\u010d, J., Schnitger, G.: Comparing the size of NFAs with and without \u03b5-transitions. Theor. Comput. Sci.\u00a0380(1-2), 100\u2013114 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1006\/inco.2001.3040","volume":"169","author":"J. Hromkovi\u010d","year":"2001","unstructured":"Hromkovi\u010d, J., Schnitger, G.: On the power of Las Vegas for one-way communication complexity, OBDD\u2019s, and finite automata. Information and Computation\u00a0169, 284\u2013296 (2001)","journal-title":"Information and Computation"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BFb0029950","volume-title":"Mathematical Foundations of Computer Science 1997","author":"J. Hromkovi\u010d","year":"1997","unstructured":"Hromkovi\u010d, J., Schnitger, G.: Communication Complexity and Sequential Computation. In: Pr\u00edara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 71\u201384. Springer, Heidelberg (1997)"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jcss.2001.1748","volume":"62","author":"J. Hromkovi\u010d","year":"2001","unstructured":"Hromkovi\u010d, J., Seibert, S., Wilke, T.: Translating regular expression into small \u03b5-free nondeterministic automata. J. Comput. Syst. Sci.\u00a062(4), 565\u2013588 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03442-2","volume-title":"Communication Complexity and Parallel Computating","author":"J. Hromkovi\u010d","year":"1997","unstructured":"Hromkovi\u010d, J.: Communication Complexity and Parallel Computating. Springer, Heidelberg (1997)"},{"key":"3_CR14","first-page":"311","volume":"48-49","author":"J. Hromkovi\u010d","year":"1986","unstructured":"Hromkovi\u010d, J.: Relation Between Chomsky Hierarchy and Communication Complexity Hierarchy. Acta Math. Univ. Com\u00a048-49, 311\u2013317 (1986)","journal-title":"Acta Math. Univ. Com"},{"issue":"6","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput.\u00a022(6), 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"key":"3_CR16","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539793252092","volume":"27","author":"H. Leung","year":"1998","unstructured":"Leung, H.: Separating exponential ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput.\u00a027(4), 1073\u20131082 (1998)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"3_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(02)00436-2","volume":"85","author":"Y. Lifshits","year":"2003","unstructured":"Lifshits, Y.: A lower bound on the size of \u03b5-free NFA corresponding to a regular expression. Inf. Process. Lett.\u00a085(6), 293\u2013299 (2003)","journal-title":"Inf. Process. Lett."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proc. 13th Ann. IEEE Symp. on Switching and Automate Theory, pp. 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M. Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM\u00a051(2), 231\u2013262 (2004)","journal-title":"J. ACM"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Sipser, M.: Communication Complexity. In: Proc. 14th ACM STOC, pp. 196\u2013200 (1982)","DOI":"10.1145\/800070.802192"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/0022-0000(90)90028-J","volume":"41","author":"L. Pitt","year":"1990","unstructured":"Pitt, L., Warmuth, M.K.: Prediction-preserving reducibility. J. Comput. Syst. Sci.\u00a041(3), 430\u2013467 (1990)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"3_CR23","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 presentation. SIAM J. Comput.\u00a018(6), 1263\u20131282 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jcss.1997.1494","volume":"55","author":"A.A. Razborov","year":"1997","unstructured":"Razborov, A.A., Rudich, S.: Natural proofs. J. Comput. Syst. Sci.\u00a055(1), 24\u201335 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/11672142_35","volume-title":"STACS 2006","author":"G. Schnitger","year":"2006","unstructured":"Schnitger, G.: Regular expressions and NFAs without \u03b5 transitions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 432\u2013443. Springer, Heidelberg (2006), \n www.thi.informatik.uni-frankfurt.de"},{"key":"3_CR26","series-title":"Languages and Parsing","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61345-6","volume-title":"Parsing Theory","author":"S. Sippu","year":"1988","unstructured":"Sippu, S., Soisalon-Soininen, E.: Parsing Theory. Languages and Parsing, vol.\u00a0I. Springer, Heidelberg (1988)"},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R.E. Stearns","year":"1985","unstructured":"Stearns, R.E., Hunt III, H.B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM J. Comput.\u00a014(3), 598\u2013611 (1985)","journal-title":"SIAM J. Comput."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Some Complexity Questions Related to Distributed Computing. In: Proc. 11th ACM STOC, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(96)00062-X","volume":"168","author":"M. Dietzfelbinger","year":"1996","unstructured":"Dietzfelbinger, M., Hromkovi\u010d, J., Schnitger, G.: A comparison of two lower bound methods for communication complexity. Theoretical Computer Science\u00a0168, 39\u201351 (1996)","journal-title":"Theoretical Computer Science"},{"key":"3_CR30","volume-title":"Paths, Flows, and VLSI Layout","author":"L. Lov\u00e1sz","year":"1990","unstructured":"Lov\u00e1sz, L.: Communication Complexity. A survey. In: Korte, L., Promel, S. (eds.) Paths, Flows, and VLSI Layout. Springer, Berlin (1990)"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45322-9_1","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"J. Hromkovi\u010d","year":"2001","unstructured":"Hromkovi\u010d, J.: Randomized communication protocols (A survey). In: Steinh\u00f6fel, K. (ed.) SAGA 2001. LNCS, vol.\u00a02264, pp. 1\u201332. Springer, Heidelberg (2001)"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J.: Communicatoin protocols - an exemplary study of the power of randomness. In: Rajasekharan, S., Pardalos, P.M., Reif, J.H., Rolim, J. (eds.) Handbook of Randomized Computing, vol.\u00a0II, pp. 533\u2013596","DOI":"10.1007\/978-1-4615-0013-1_14"},{"key":"#cr-split#-3_CR33.1","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 state automata. In: Proc. 3rd Int. Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, pp. 23-34. Univ. Magdeburg (2001), Preprint No. 16"},{"key":"#cr-split#-3_CR33.2","unstructured":"See also Journal of Automata, Languages and Combinatorics 7 (4), 419-432 (2002)"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-45005-X_13","volume-title":"Developments in Language Theory","author":"H.N. Adorna","year":"2003","unstructured":"Adorna, H.N.: On the separation between k-party and (k\u2009+\u20091)-party nondeterministic message complexity. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 152\u2013161. Springer, Heidelberg (2003)"},{"key":"3_CR35","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. Information Processing Letters\u00a059, 75\u201377 (1996)","journal-title":"Information Processing Letters"},{"key":"3_CR36","unstructured":"Petersen, H.: personal communication"},{"key":"3_CR37","first-page":"166","volume":"47","author":"A. Arnold","year":"1992","unstructured":"Arnold, A., Dicky, A., Nivat, M.: A note about minimal non-deterministic automata. Bulletin of the EATCS\u00a047, 166\u2013169 (1992)","journal-title":"Bulletin of the EATCS"},{"key":"3_CR38","unstructured":"Carrez, C.: On the minimalization of non-deterministic automaton, Laboratoire de Calcul de la Facult\u00e9 des Sciences de l\u2019Universit\u00e9 de Lille (1970)"},{"key":"3_CR39","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."},{"issue":"2","key":"3_CR40","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02090394","volume":"24","author":"B. Courcelle","year":"1991","unstructured":"Courcelle, B., Niwinski, D., Podelski, A.: A Geometrical View of the Determinization and Minimization of Finite-State Automata. Mathematical Systems Theory\u00a024(2), 117\u2013146 (1991)","journal-title":"Mathematical Systems Theory"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Gruber, H., Holzer, M.: Finding Lower Bounds for Nondeterministic State Complexity is Hard. Developments in Language Theory 2006, 363\u2013374 (2006)","DOI":"10.1007\/11779148_33"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Salomaa, K.: Descriptional Complexity of Nondeterministic Finite Automata. Developments in Lanugage Theory 2007, 31\u201335 (2007)","DOI":"10.1007\/978-3-540-73208-2_6"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T15:43:55Z","timestamp":1674834235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}