State complexity of GF(2)-operations on unary languages

Abstract The paper investigates the state complexity of two operations on regular languages, known as GF(2)-concatenation and GF(2)-inverse (Bakinova et al., “Formal languages over GF(2)”, LATA 2018), in the case of a one-symbol alphabet. The GF(2)-concatenation is a variant of the classical concatenation obtained by replacing Boolean logic in its definition with the GF(2) field; it is proved that GF(2)-concatenation of two unary languages recognized by an m-state and an n-state DFA is recognized by a DFA with 2 m n states, and this number of states is necessary in the worst case, as long as m and n are relatively prime. This operation is known to have an inverse, and the state complexity of the GF(2)-inverse operation over a unary alphabet is proved to be exactly 2 n − 1 + 1 , with the proof based on primitive polynomials over GF(2). For a generalization of the GF(2)-inverse, called the GF(2)-star, the state complexity in the unary case is exactly 2 n .

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

[2]  Carlo Mereghetti,et al.  Converting two-way nondeterministic unary automata into simpler automata , 2003, Theor. Comput. Sci..

[3]  Lynette van Zijl,et al.  Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata , 2017, AFL.

[4]  Alexander Okhotin,et al.  On the Expressive Power of GF(2)-Grammars , 2019, SOFSEM.

[5]  Jeffrey Shallit,et al.  Unary Language Operations, State Complexity and Jacobsthal's Function , 2002, Int. J. Found. Comput. Sci..

[6]  Alexander Okhotin.  Unambiguous finite automata over a unary alphabet , 2012, Inf. Comput..

[7]  Alexander Okhotin,et al.  State complexity of unambiguous operations on finite automata , 2019, Theor. Comput. Sci..

[8]  Michael Domaratzki,et al.  Orthogonal Concatenation: Language Equations and State Complexity , 2010, J. Univers. Comput. Sci..

[9]  Alexander Okhotin,et al.  Formal Languages over GF(2) , 2018, LATA.

[10]  Alexander Okhotin,et al.  Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups , 2011, Developments in Language Theory.

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

[12]  Brink van der Merwe,et al.  Ambiguity of Unary Symmetric Difference NFAs , 2011, ICTAC.

[13]  Brink van der Merwe,et al.  Minimal DFA for Symmetric Difference NFA , 2012, DCFS.

[14]  Carlo Mereghetti,et al.  Optimal Simulations Between Unary Automata , 1998, STACS.

[15]  Alexander Okhotin,et al.  State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages , 2019, DCFS.

[16]  Janusz Brzozowski,et al.  Quotient Complexity of Regular Languages , 2009, J. Autom. Lang. Comb..