The Ranges of Accepting State Complexities of Languages Resulting From Some Operations
We examine the accepting state complexity, i.e., the minimal number of accepting states of deterministic finite automata (DFAs) for languages resulting from unary and binary operations on languages with accepting state complexity given as a parameter. This is continuation of the work of [J. Dassow: On the number of accepting states of finite automata, J. Autom., Lang. Comb., 21, 2016]. We solve most of the open problems mentioned thereof. In particular, we consider the operations of intersection, symmetric difference, right and left quotients, reversal, and permutation (on finite languages), where we obtain precise ranges of the accepting state complexities.
- 3.Dassow, J.: On the number of accepting states of finite automata. J. Autom. Lang. Comb. 21(1–2), 55–67 (2016)Google Scholar
- 7.Hricko, M., Jirásková, G., Szabari, A.: Union and intersection of regular languages and descriptional complexity. In: DCFS 2005, pp. 170–181 (2005)Google Scholar
- 11.Jirásková, G.: Personal communication (2017)Google Scholar