{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T23:02:07Z","timestamp":1762210927760,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983547"},{"type":"electronic","value":"9783319983554"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98355-4_2","type":"book-chapter","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T10:34:57Z","timestamp":1533724497000},"page":"17-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity"],"prefix":"10.1007","author":[{"given":"Michal","family":"Hospod\u00e1r","sequence":"first","affiliation":[]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Mlyn\u00e1r\u010dik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Ullman, J.D., Yannakakis, M.: On notions of information transfer in VLSI circuits. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC 1983, pp. 133\u2013139. ACM, New York (1983)","DOI":"10.1145\/800061.808742"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J Birget","year":"1992","unstructured":"Birget, J.: Intersection and union of regular languages and state complexity. Inf. Process. Lett. 43(4), 185\u2013190 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"2_CR3","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)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Kung, H.T.: The chip complexity of binary arithmetic. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC 1980, pp. 190\u2013200. ACM, New York (1980)","DOI":"10.1145\/800141.804666"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-41114-9_6","volume-title":"Descriptional Complexity of Formal Systems","author":"J Brzozowski","year":"2016","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Liu, B., Rajasekaran, A., Szyku\u0142a, M.: On the state complexity of the shuffle of regular languages. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 73\u201386. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41114-9_6"},{"issue":"2","key":"2_CR6","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)","journal-title":"Inf. Process. Lett."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/11779148_33","volume-title":"Developments in Language Theory","author":"H Gruber","year":"2006","unstructured":"Gruber, H., Holzer, M.: Finding lower bounds for nondeterministic state complexity is hard. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 363\u2013374. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779148_33"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Han, Y., Salomaa, K.: Nondeterministic state complexity for suffix-free regular languages. In: McQuillan, I., Pighizzini, G. (eds.) Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010. EPTCS, vol. 31, pp. 189\u2013196 (2010)","DOI":"10.4204\/EPTCS.31.21"},{"issue":"1\u20132","key":"2_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"Y Han","year":"2009","unstructured":"Han, Y., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fundam. Inform. 90(1\u20132), 93\u2013106 (2009)","journal-title":"Fundam. Inform."},{"issue":"6","key":"2_CR10","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)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR11","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-40946-7_11","volume-title":"Implementation and Application of Automata","author":"M Hospod\u00e1r","year":"2016","unstructured":"Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Mlyn\u00e1r\u010dik, P.: Nondeterministic complexity of operations on closed and ideal languages. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 125\u2013137. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40946-7_11"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-319-60134-2_12","volume-title":"Implementation and Application of Automata","author":"M Hospod\u00e1r","year":"2017","unstructured":"Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Mlyn\u00e1r\u010dik, P.: Nondeterministic complexity of operations on free and convex languages. In: Carayol, A., Nicaud, C. (eds.) CIAA 2017. LNCS, vol. 10329, pp. 138\u2013150. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60134-2_12"},{"issue":"3","key":"2_CR14","first-page":"229","volume":"7","author":"J Hromkovi\u010d","year":"1988","unstructured":"Hromkovi\u010d, J.: Some complexity aspects of VLSI computations, part 1. Comput. Artif. Intell. 7(3), 229\u2013252 (1988)","journal-title":"Comput. Artif. Intell."},{"key":"2_CR15","first-page":"121","volume":"10","author":"G Jir\u00e1skov\u00e1","year":"1991","unstructured":"Jir\u00e1skov\u00e1, G.: Comparison of two VLSI models. Comput. Artif. Intell. 10, 121\u2013232 (1991)","journal-title":"Comput. Artif. Intell."},{"issue":"2","key":"2_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. Theor. Comput. Sci. 330(2), 287\u2013298 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1142\/S0129054111008933","volume":"22","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: Complexity in union-free regular languages. Int. J. Found. Comput. Sci. 22(7), 1639\u20131653 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-09704-6_20","volume-title":"Descriptional Complexity of Formal Systems","author":"G Jir\u00e1skov\u00e1","year":"2014","unstructured":"Jir\u00e1skov\u00e1, G., Mlyn\u00e1r\u010dik, P.: Complement on prefix-free, suffix-free, and non-returning NFA languages. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 222\u2013233. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09704-6_20"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Sedgewick, R.: Lower bounds for VLSI. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, STOC 1981, pp. 300\u2013307. ACM, New York, NY, USA (1981)","DOI":"10.1145\/800076.802482"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-19225-3_16","volume-title":"Descriptional Complexity of Formal Systems","author":"P Mlyn\u00e1r\u010dik","year":"2015","unstructured":"Mlyn\u00e1r\u010dik, P.: Complement on free and ideal languages. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 185\u2013196. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19225-3_16"},{"key":"2_CR21","unstructured":"Mlyn\u00e1r\u010dik, P.: Nondeterministic state complexity in subregular classes. Dissertation thesis. FMFI UK, Bratislava (2017). http:\/\/im.saske.sk\/~jiraskov\/students\/phd_thesis_mlynarcik.pdf"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-68402-9_8","volume-title":"VLSI Systems and Computations","author":"JE Savage","year":"1981","unstructured":"Savage, J.E.: Planar circuit complexity and the performance of VLSI algorithms +. In: Kung, H.T., Sproull, B., Steele, G. (eds.) VLSI Systems and Computations, pp. 61\u201368. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/978-3-642-68402-9_8"},{"key":"2_CR23","unstructured":"Sipser, M.: Introduction to the theory of computation. Cengage Learning (2012)"},{"key":"2_CR24","doi-asserted-by":"publisher","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. I, 1st edn. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_2","edition":"1"}],"container-title":["Lecture Notes in Computer Science","Adventures Between Lower Bounds and Higher Altitudes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98355-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:54:51Z","timestamp":1710348891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98355-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983547","9783319983554"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98355-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}