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, M. Szykuu, and . La, Complexity of suffix-free regular languages, Journal of Computer and System Sciences, vol.89, pp.270-287, 2017.

R. Cmorik and G. Jirásková, Basic operations on binary suffix-free languages, MEMICS 2011, vol.7119, pp.94-102

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.

Y. Han and K. Salomaa, State complexity of basic operations on suffix-free regular languages, Theoretical Computer Science, vol.410, pp.2537-2548, 2009.

Y. Han and K. Salomaa, Nondeterministic State Complexity for Suffix-Free Regular Languages, DCFS 2010, vol.31, pp.189-196

Y. Han, K. Salomaa, and D. Wood, Operational state complexity of prefix-free regular languages, Automata, Formal Languages, and Related Topics, pp.99-115, 2009.

Y. Han, K. Salomaa, and D. Wood, Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages, Fundamenta Informaticae, vol.90, pp.93-106, 2009.

M. Holzer and M. Kutrib, Nondeterministic descriptional complexity of regular languages, International Journal of Foundations of Computer Science, vol.14, pp.1087-1102, 2003.

J. Jirásek, G. Jirásková, and A. Szabari, State complexity of concatenation and complementation, International Journal of Foundations of Computer Science, vol.16, issue.3, pp.511-529, 2005.

J. Jirásek, G. Jirásková, and J. Sebej, Operations on unambiguous finite automata, vol.9840, pp.243-255, 2016.

G. Jirásková and M. Krausová, Complexity in prefix-free regular languages, DCFS 2010, vol.31, pp.197-204

G. Jirásková and P. Olejár, State complexity of intersection and union of suffix-free languages and descriptional complexity, NCMA 2009, books@ocg.at, vol.256, pp.151-166

G. Jirásková and A. Okhotin, On the state complexity of operations on two-way finite automata, vol.253, pp.36-63, 2017.

M. Kunc and A. Okhotin, State complexity of union and intersection for two-way nondeterministic finite automata, Fundamenta Informaticae, vol.110, pp.231-239, 2011.

M. Kunc and A. Okhotin, State complexity of operations on two-way deterministic finite automata over a unary alphabet, Theoretical Computer Science, pp.106-118, 2012.

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

A. Okhotin, Unambiguous finite automata over a unary alphabet, 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.

N. Rampersad, B. Ravikumar, N. Santean, and J. Shallit, State complexity of unique rational operations, Theoretical Computer Science, vol.410, pp.2431-2441, 2009.

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.