Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 4.03.1971
Phone: 89278262103
Keywords: regular languages, nondeterministic finite automata, the basis automaton, paths and loops of a directed graph, algorithms for equivalent transformation, state-marking functions the universal automaton, methods of teaching mathematics.
UDC: 519.178, 372.851

Subject:

The definition of a basis automaton, the study of its properties. Various algorithms for minimization of finite automata for a given regular language. Study of some dynamic risk functions. Methods of teaching mathematics.

Main publications:

1. Vakhitova A.A., “THE BASIS AUTOMATON FOR THE GIVEN REGULAR LANGUAGE”, Vakhitova A.A. (now Melnikova A.A.), Journal of Applied Mathematics and Computing, 6:3 (1999.), 617-624
2. Melnikov B.F., Melnikova A.A., “EDGE-MINIMIZATION OF NON-DETERMINISTIC FINITE AUTOMATA”, Korean Journal of Computational and Applied Mathematics, 8:3 (2001), 469-479
3. Melnikov B., Melnikova A., “A NEW ALGORITHM OF CONSTRUCTING THE BASIS FINITE AUTOMATON”, Informatica, 13:3 (2002), 299-310
4. Melnikov B.F., Melnikova A.A., “PSEUDO-AUTOMATA FOR GENERALIZED REGULAR EXPRESSIONS”, International Journal of Open Information Technologies, 6:1 (2018), 1-8
5. Melnikov B.F., Melnikova A.A., “AN APPROACH TO THE CLASSIFICATION OF THE LOOPS OF FINITE AUTOMATA. PART I: LONG CORRESPONDING LOOPS”, International Journal of Open Information Technologies, 6:9 (2018), 9-14

Publications in Math-Net.Ru

Personal pages:

• 

Organisations:

• Dimitrovgrad Engineering Institute of Technology – Branch of National Research Nuclear University MEPhI