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.

[1]  Yahiko Kambayashi,et al.  Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs , 2000, Theor. Comput. Sci..

[2]  Jürgen Dassow.  Descriptional Complexity and Operations - Two Non-classical Cases , 2017, DCFS.

[3]  Juraj Sebej,et al.  Reversal of binary regular languages , 2012, Theor. Comput. Sci..

[4]  Marek Chrobak,et al.  Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..

[5]  Sheng Yu,et al.  On the state complexity of intersection of regular languages , 1991, SIGA.

[6]  Yo-Sub Han,et al.  State complexity of permutation on finite languages over a binary alphabet , 2017, Theor. Comput. Sci..

[7]  Galina Jirásková,et al.  Magic Numbers and Ternary Alphabet , 2009, Int. J. Found. Comput. Sci..

[8]  Galina Jirásková,et al.  Union and Intersection of Regular Languages and Descriptional Complexity , 2005, DCFS.

[9]  Ernst L. Leiss,et al.  Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

[10]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[11]  Jürgen Dassow.  On the Number of Accepting States of Finite Automata , 2016, J. Autom. Lang. Comb..

[12]  Juraj Sebej,et al.  Reversal on Regular Languages and Descriptional Complexity , 2013, DCFS.

[13]  Mike Paterson,et al.  A family of NFAs which need 2n- deterministic states , 2003, Theor. Comput. Sci..

[14]  Viliam Geffert,et al.  Magic numbers in the state hierarchy of finite automata , 2006, Inf. Comput..

[15]  Sheng Yu,et al.  The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..