Power, positive closure, and quotients on convex languages

Hospodár, 2019, Descriptional complexity of power and positive closure on convex languages, vol. 11601, 158 Maslov, 1970, Estimates of the number of states of finite automata, Sov. Math. Dokl., 11, 1373 Yu, 1994, The state complexities of some basic operations on regular languages, Theor. Comput. Sci., 125, 315, 10.1016/0304-3975(92)00011-F Holzer, 2003, Nondeterministic descriptional complexity of regular languages, Int. J. Found. Comput. Sci., 14, 1087, 10.1142/S0129054103002199 Pighizzini, 2002, Unary language operations, state complexity and Jacobsthal's function, Int. J. Found. Comput. Sci., 13, 145, 10.1142/S012905410200100X Câmpeanu, 1999, State complexity of basic operations on finite languages, vol. 2214, 60 Han, 2009, Operational state complexity of prefix-free regular languages, 99 Han, 2009, Nondeterministic state complexity of basic operations for prefix-free regular languages, Fundam. Inform., 90, 93, 10.3233/FI-2009-0008 Han, 2009, State complexity of basic operations on suffix-free regular languages, Theor. Comput. Sci., 410, 2537, 10.1016/j.tcs.2008.12.054 Han, 2010, Nondeterministic state complexity for suffix-free regular languages, vol. 31, 189 Brzozowski, 2014, Quotient complexity of bifix-, factor-, and subword-free regular languages, Acta Cybern., 21, 507, 10.14232/actacyb.21.4.2014.1 Brzozowski, 2013, Quotient complexity of ideal languages, Theor. Comput. Sci., 470, 36, 10.1016/j.tcs.2012.10.055 Brzozowski, 2014, Quotient complexity of closed languages, Theory Comput. Syst., 54, 277, 10.1007/s00224-013-9515-7 Brzozowski, 2010, Complexity in convex languages, vol. 6031, 1 Jirásková, 2014, Complement on prefix-free, suffix-free, and non-returning NFA languages, vol. 8614, 222 Mlynárčik, 2015, Complement on free and ideal languages, vol. 9118, 185 Hospodár, 2016, Nondeterministic complexity of operations on closed and ideal languages, vol. 9705, 125 Hospodár, 2017, Nondeterministic complexity of operations on free and convex languages, vol. 10329, 138 Hospodár, 2019, Nondeterministic complexity in subclasses of convex languages, Theor. Comput. Sci., 10.1016/j.tcs.2018.12.027 Čevorová, 2015, Square on ideal, closed and free languages, vol. 9118, 70 Čevorová, 2016, Square on closed languages, vol. 321, 121 Hopcroft, 1979 Sipser, 2012 Yu, 1997, Regular languages, 41 Jirásková, 2019, NFA-to-DFA trade-off for regular operations, vol. 11612, 184 Birget, 1992, Intersection and union of regular languages and state complexity, Inf. Process. Lett., 43, 185, 10.1016/0020-0190(92)90198-5 Hospodár, 2018, A survey on fooling sets as effective tools for lower bounds on nondeterministic complexity, vol. 11011, 17 Jirásková, 2011, Complexity in union-free regular languages, Int. J. Found. Comput. Sci., 22, 1639, 10.1142/S0129054111008933 Cmorik, 2011, Basic operations on binary suffix-free languages, vol. 7119, 94 Čevorová, 2014, Operations on automata with all states final, vol. 151, 201 Jirásková, 2012, Reversal of binary regular languages, Theor. Comput. Sci., 449, 85, 10.1016/j.tcs.2012.05.008 Brzozowski, 2019, Complexity of proper prefix-convex regular languages, Theor. Comput. Sci., 787, 2, 10.1016/j.tcs.2018.07.015 Sinnamon, 2018, Complexity of proper suffix-convex regular languages, vol. 10977, 324 Han, 2006, Infix-free regular expressions and languages, Int. J. Found. Comput. Sci., 17, 379, 10.1142/S0129054106003887 Jirásek, 2016, Prefix-free languages: left and right quotient and reversal, Theor. Comput. Sci., 610, 78, 10.1016/j.tcs.2015.08.031 Jirásková, 2014, Kleene closure on regular and prefix-free languages, vol. 8587, 226