I. Assent and S. Seibert, An upper bound for transforming self-verifying automata into deterministic ones, RAIRO - Theoretical Informatics and Applications, vol.20, issue.3, pp.261-265, 2007.
DOI : 10.1109/T-C.1971.223108

J. C. Birget, Partial orders on words, minimal elements of regular languages, and state complexity, Theoretical Computer Science, vol.119, issue.2, pp.267-291, 1993.
DOI : 10.1016/0304-3975(93)90160-U
URL : https://doi.org/10.1016/0304-3975(93)90160-u

J. A. Brzozowski, Quotient Complexity of Regular Languages, Electronic Proceedings in Theoretical Computer Science, vol.125, pp.71-89, 2010.
DOI : 10.1007/978-3-642-59136-5_2
URL : http://arxiv.org/pdf/0907.4547v1.pdf

?. Duri?, P. Hromkovi?, J. Rolim, J. Schnitger, and G. , Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations, STACS. LNCS, pp.117-128, 1997.

U. L. Ershov, On a conjecture of W.U. Uspenskii. Algebra i logika (seminar) 1, pp.45-48, 1962.

I. Glaister and J. Shallit, A lower bound technique for the size of nondeterministic finite automata, Information Processing Letters, vol.59, issue.2, pp.75-77, 1996.
DOI : 10.1016/0020-0190(96)00095-6

M. Holzer and M. Kutrib, NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES, International Journal of Foundations of Computer Science, vol.76, issue.06, pp.1087-1102, 2003.
DOI : 10.1016/0304-3975(92)00011-F

J. Hromkovi? and G. Schnitger, On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata, Information and Computation, vol.169, issue.2, pp.284-296, 2001.
DOI : 10.1006/inco.2001.3040

J. Jirásek, . Jr, G. Jirásková, and A. Szabari, Operations on Self-Verifying Finite Automata, CSR 2015, pp.231-261, 2015.
DOI : 10.1007/978-3-319-20297-6_16

G. Jirásková, State complexity of some operations on binary regular languages, Theoretical Computer Science, vol.330, issue.2, pp.287-298, 2005.
DOI : 10.1016/j.tcs.2004.04.011

G. Jirásková and G. Pighizzini, Optimal simulation of self-verifying automata by deterministic automata, Information and Computation, vol.209, issue.3, pp.528-535, 2011.
DOI : 10.1016/j.ic.2010.11.017

G. Jirásková and J. Sebej, Reversal of binary regular languages, Theoretical Computer Science, vol.449
DOI : 10.1016/j.tcs.2012.05.008

E. Leiss, Succinct representation of regular languages by boolean automata, Theoretical Computer Science, vol.13, issue.3, pp.323-330, 1981.
DOI : 10.1016/S0304-3975(81)80005-9
URL : https://doi.org/10.1016/s0304-3975(81)80005-9

O. B. Lupanov, A comparison of two types of finite automata, Problemy Kibernetiki, vol.9, pp.321-326, 1963.

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

B. G. Mirkin, On dual automata, Cybernetics, vol.3, issue.1, pp.7-10, 1966.
DOI : 10.1145/321239.321249

J. W. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics, vol.3, issue.1, pp.23-28, 1965.
DOI : 10.1007/BF02760024

F. Moore, On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata, IEEE Transactions on Computers, vol.20, issue.10, pp.1211-1214, 1971.
DOI : 10.1109/T-C.1971.223108

M. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959.
DOI : 10.1147/rd.32.0114

W. J. Sakoda and M. Sipser, Nondeterminism and the size of two way finite automata, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.275-286, 1978.
DOI : 10.1145/800133.804357

M. Sipser, Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 1997.
DOI : 10.1145/230514.571645

S. Yu, Chapter 2: Regular languages Handbook of Formal Languages, pp.41-110, 1997.

S. Yu, Q. Zhuang, K. Salomaa, and K. Cevorová, The state complexities of some basic operations on regular languages, DCFS 2013, pp.315-328, 1994.
DOI : 10.1016/0304-3975(92)00011-F