| Once more on the edge-minimization of nondeterministic finite automata and the connected problems B Melnikov Fundamenta Informaticae 104 (3), 267-283, 2010 | 82 | 2010 |
| Мультиэвристический подход к задачам дискретной оптимизации БФ Мельников Кибернетика и Системный Анализ. Изд-во НАН Украины, 32-42, 2006 | 66 | 2006 |
| Discrete optimization problems-some new heuristic approaches B Melnikov Eighth International Conference on High-Performance Computing in Asia …, 2005 | 61 | 2005 |
| Possible edges of a finite automaton defining a given regular language BF Melnikov, NV Sciarini-Guryanova Journal of Applied Mathematics and Computing 9 (2), 475-485, 2002 | 59 | 2002 |
| Multiheuristic approach to discrete optimization problems BF Melnikov Cybernetics and Systems Analysis 42 (3), 335-341, 2006 | 57 | 2006 |
| Эвристики в программировании недетерминированных игр БФ Мельников Известия РАН. Программирование, 63-80, 2001 | 57* | 2001 |
| Some more on the finite automata BF Melnikov, A Vakhitova The Korean journal of computational & applied mathematics, 한국전산응용수학 …, 1998 | 57 | 1998 |
| Some properties of the basis finite automaton BF Melnikov, AA Melnikova Journal of Applied Mathematics and Computing 9 (1), 135-150, 2002 | 54 | 2002 |
| The equality condition for infinite catenations of two sets of finite words BF MELNIKOV International Journal of Foundations of Computer Science 4 (03), 267-274, 1993 | 52 | 1993 |
| The complete finite automaton BF Melnikov International Journal of Open Information Technologies 5 (10), 9-17, 2017 | 51 | 2017 |
| A new algorithm of the state-minimization for the nondeterministic finite automata BF Melnikov Korean Journal of Computational & Applied Mathematics 6, 277-290, 1999 | 44 | 1999 |
| Extended nondeterministic finite automata B Melnikov Fundamenta Informaticae 104 (3), 255-265, 2010 | 43 | 2010 |
| Недетерминированные конечные автоматы БФ Мельников Федеральное государственное бюджетное образовательное учреждение высшего …, 2009 | 42 | 2009 |
| Some grammatical structures of programming languages as simple bracketed languages B Melnikov, E Kashlakova Informatica 11 (4), 441-454, 2000 | 41 | 2000 |
| Edge-minimization of non-deterministic finite automata BF Melnikov, AA Melnikova Korean Journal of Computational and Applied Mathematics 8 (3), 469-479, 2001 | 40 | 2001 |
| Some special heuristics for discrete optimization problems B Melnikov, A Radionov, V Gumayunov International Conference on Enterprise Information Systems 2, 360-364, 2006 | 39 | 2006 |
| Once more about the state-minimization of the nondeterministic finite automata BF Melnikov Korean journal of computational & applied mathematics 7 (3), 655-662, 2000 | 39 | 2000 |
| The state minimization problem for nondeterministic finite automata: the parallel implementation of the truncated branch and bound method B Melnikov, A Tsyganov 2012 Fifth International Symposium on Parallel Architectures, Algorithms and …, 2012 | 38 | 2012 |
| Some specific heuristics for situation clustering problems. B Melnikov, A Radionov, A Moseev, E Melnikova ICSOFT (2), 272-279, 2006 | 33 | 2006 |
| On the task of extracting the root from the language KS Yu International Journal of Open Information Technologies 7 (3), 1-6, 2019 | 29 | 2019 |
