State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages

[1]  Wen Bao Han,et al.  The coefficients of primitive polynomials over finite fields , 1996, Math. Comput..

[2]  H. Davenport.  Bases for Finite Fields , 1968 .

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

[4]  Galina Jirásková,et al.  State complexity of some operations on binary regular languages , 2005, Theor. Comput. Sci..

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

[6]  Vladislav Makarov,et al.  Bounded languages described by GF(2)-grammars , 2019, DLT.

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

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

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

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

[11]  Jean-Camille Birget,et al.  Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity , 1993, Theor. Comput. Sci..

[12]  Alexander Okhotin,et al.  State complexity of cyclic shift , 2008, RAIRO Theor. Informatics Appl..

[13]  Alexander Okhotin,et al.  State Complexity of Unambiguous Operations on Deterministic Finite Automata , 2018, DCFS.

[14]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .