S. Afonin and D. Golomazov, Minimal union-free decompositions of regular languages, LATA 2009, vol.5457, pp.83-92, 2009.

J. A. Brzozowski, Regular expression techniques for sequential circuits, 1962.

J. A. Brzozowski and S. Davies, Most complex deterministic union-free regular languages, DCFS 2018, vol.10952, pp.37-48, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01905640

S. Crvenkovi?, I. Dolinka, and Z. Ésik, On equations for union-free regular languages, Inform. and Comput, vol.164, issue.1, pp.152-172, 2001.

M. Holzer, M. Kutrib, S. Konstantinidis, N. Moreira, and R. Reis, The Role of Theory in Computer Science -Essays Dedicated to Janusz Brzozowski, pp.59-82, 2017.

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

G. Jirásková and T. Masopust, Complexity in union-free regular languages. Internat, J. Found. Comput. Sci, vol.22, issue.7, pp.1639-1653, 2011.

G. Jirásková and B. Nagy, On union-free and deterministic union-free languages, TCS 2012, vol.7604, pp.179-192, 2012.

M. Kutrib and M. Wendlandt, Expressive capacity of subregular expressions, RAIRO Theor. Inform. Appl, vol.52, issue.2-3-4, pp.201-218, 2018.

B. Nagy, A normal form for regular expressions, CDMTCS Report, vol.252, pp.51-60, 2004.

B. Nagy, Union-free regular languages and 1-cycle-free-path-automata, Publ. Math. Debrecen, vol.68, pp.183-197, 2006.

B. Nagy, On union-complexity of regular languages, Proc. 11th IEEE International Symposium on Computational Intelligence and Informatics, CINTI 2010, pp.177-182, 2010.

S. Yu, Regular languages, Handbook of Formal Languages, vol.1, pp.41-110, 1997.