E. Bakinova, A. Basharin, I. Batmanov, K. Lyubort, A. Okhotin et al., Formal languages over GF(2), Language and Automata Theory and Applications, vol.10792, pp.68-79, 2018.

J. A. Brzozowski, Quotient complexity of regular languages, Languages and Combinatorics, vol.15, pp.71-89, 2010.

M. Chrobak, Finite automata and unary languages, Theoretical Computer Science, vol.47, pp.497-498, 1986.

M. Daley, M. Domaratzki, and K. Salomaa, Orthogonal concatenation: Language equations and state complexity, Journal of Universal Computer Science, vol.16, issue.5, pp.653-675, 2010.

V. Geffert, C. Mereghetti, and G. Pighizzini, Converting two-way nondeterministic unary automata into simpler automata, Theoretical Computer Science, vol.295, pp.189-203, 2003.

G. Jirásková and A. Okhotin, State complexity of unambiguous operations on deterministic finite automata, Descriptional Complexity of Formal Systems (DCFS 2018, vol.10952, pp.188-199, 2018.

M. Kunc and A. Okhotin, Describing periodicity in two-way deterministic finite automata using transformation semigroups, Developments in Language Theory (DLT 2011, vol.6795, pp.324-336, 2011.

V. Makarov and A. Okhotin, On the expressive power of GF(2)-grammars, SOFSEM 2019: Theory and Practice of Computer Science, vol.11376, pp.310-323, 2019.

A. N. Maslov, Estimates of the number of states of finite automata, Soviet Mathematics Doklady, vol.11, pp.1373-1375, 1970.

C. Mereghetti and G. Pighizzini, Optimal simulations between unary automata, SIAM Journal on Computing, vol.30, issue.6, pp.1976-1992, 2001.

A. Okhotin, Unambiguous finite automata over a unary alphabet, Information and Computation, vol.212, pp.15-36, 2012.

G. Pighizzini and J. Shallit, Unary language operations, state complexity and Jacobsthal's function, International Journal of Foundations of Computer Science, vol.13, pp.145-159, 2002.

S. Yu, Q. Zhuang, and K. Salomaa, The state complexity of some basic operations on regular languages, Theoretical Computer Science, vol.125, pp.315-328, 1994.