Trakhtenbrot B. Barzdins J.:
Finite Automata: Behavior and synthesis.
Science,
Moscow.
Michael Domaratzki, Derek Kisman & Jeffrey Shallit (2002):
On the number of distinct languages accepted by finite automata with n states.
Journal of Automata, Languages and Combinatorics 7(4),
pp. 469–486.
Gregor Gramlich & Georg Schnitger (2007):
Minimizing nfa's and regular expressions.
Journal of Computer and System Sciences 73(6),
pp. 908 – 923,
doi:10.1016/j.jcss.2006.11.002.
Mealy George H. (1955):
A method for synthesizing sequential circuits.
Bell System Technical Journal 34(5),
pp. 1045–1079,
doi:10.1002/j.1538-7305.1955.tb03788.x.
J.E. Hopcroft & J.D. Ullman (1979):
Introduction to Automata Theory, Languages and Computation.
Addison-Wesley, Cambridge.
John Hopcroft (1971):
An n ologn Algorithm for Minimizing States in a Finite Automaton.
Theory of Machines and Computations,
pp. 189–196.
Lupanov O.B. (1984):
Asymptotic Estimates of Complexity of Control Systems.
Moscow University Press.
Tao R. (2009):
Finite Automata and Application to Cryptography.
Springer.
Maris Valdats (2011):
Transition Function Complexity of Finite Automata..
In: Markus Holzer, Martin Kutrib & Giovanni Pighizzini: Proc. of DCFS,
Lecture Notes in Computer Science 6808.
Springer,
pp. 301–313,
doi:10.1007/978-3-642-22600-7.
Sheng Yu (2000):
State Complexity of Regular Languages.
Journal of Automata, Languages and Combinatorics 6,
pp. 221–234.
eptcs@eptcs.org