References
- [1] W.Brauer, Automatentheorie. Eine Einführung in die Theorie endlicher Automaten. Teubner, 1984. ⇒241
- [2] J.Conway, Regular Algebra and Finite Machines. Chapman and Hall, 1971. ⇒ 227
- [3] F. Harary, Graph Theory. Addison-Wesley, 1969. ⇒239
- [4] T.Kameda, P.Weiner, On the state minimization of nondeterministic finite automata, IEEE Trans. on Comp., C-19, 7 (1970) 617-627. ⇒244
- [5] S. Lombardy, J. Sakarovitch, The Universal Automaton, Logic and Automata, Texts in Logic and Games, Amsterdam Univ. Press, 2 (2008) 457-504. ⇒227
- [6] B. Melnikov, On an expansion of nondeterministic finite automata, J. of Applied Math. and Computing (The Korean J. of Comp. and Appl. Math.), 24, 1-2 (2007) 155-165. ⇒227, 228, 229, 230
- [7] B. Melnikov, Once more on the edge-minimization of nondeterministic finite automata and the connected problems, Fundamenta Informaticae, 104, 3 (2010) 267-283. ⇒228, 229, 231, 232, 233, 234, 237, 242
- [8] B. Melnikov, A. Melnikova, Some properties of the basis finite automaton, J. of Applied Math. and Computing (The Korean J. of Comp. and Appl. Math.), 9, 1 (2002) 131-150. ⇒227, 228
- [9] B. Melnikov, A. Melnikova, A new algorithm of constructing the basis finite automaton, Informatica (Lithuanian Acad. Sci. Ed.), 13, 3 (2002) 299-310. ⇒ 227
- [10] B. B. Melnikov, N. Sciarini-Guryanova, Possible edges of a finite automaton defining a given regular language, J. of Applied Math. and Computing (The Korean J. of Comp. and Appl. Math.), 9, 2 (2002) 475-485. ⇒232
- [11] A.Vakhitova, The basis automaton for the given regular language, J. of Applied Math. and Computing (The Korean J. of Comp. and Appl. Math.), 6, 3 (1999) 617-624. ⇒227, 230, 236