Boris Melnikov

发表

Some Competition Programming Problems as the Beginning of Artificial Intelligence

Boris Melnikov, Elena Melnikova, 2007, Informatics Educ..

Some specific heuristics for situation clustering problems

Boris Melnikov, Elena Melnikova, Alexey Radionov, 2006, ICSOFT.

An approach to the classification of the loops of finite automata. Part i: long corresponding loops

Aleksandra Melnikova, Boris Melnikov, 2018 .

The State Minimization Problem for Nondeterministic Finite Automata: The Parallel Implementation of the Truncated Branch and Bound Method

Boris Melnikov, Andrey Vladimirovich Tsyganov, B. Melnikov, 2012, 2012 Fifth International Symposium on Parallel Architectures, Algorithms and Programming.

Mahjongg Solitaire: a High-School Student Scientific Project, Containing Elements of Artificial Intelligence

Boris Melnikov, Elena Melnikova, S V Pivneva, 2018 .

CLUSTERING OF SITUATIONS IN THE ALGORITHMS FOR SOLVING THE TRAVELING SALESMAN PROBLEM AND ITS APPLICATION IN SOME APPLIED TASKS. PART II. LIST METRICS AND SOME RELATED OPTIMIZATION PROBLEMS

Boris Melnikov, E. V. Davydova, M. A. Trenina, 2018 .

A New Algorithm of Constructing the Basis Finite Automaton

Boris Melnikov, Alexandra Melnikova, B. Melnikov, 2002, Informatica.

Some Grammatical Structures of Programming Languages as Simple Bracketed Languages

Boris Melnikov, Elena Kashlakova, B. Melnikov, 2000, Informatica.

Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems

Boris Melnikov, B. Melnikov, 2010, Fundam. Informaticae.

Mathematical modeling of organization management by value guidelines: algorithms for complex estimation and selection of pseudo-optimal actions

Boris Melnikov, Tatyana Zubova, 2018 .

A Multi-heuristic Algorithmic Skeleton for Hard Combinatorial Optimization Problems

Boris Melnikov, Andrey Vladimirovich Tsyganov, Oleg Ivanovich Bulychov, 2009, 2009 International Joint Conference on Computational Sciences and Optimization.

Linear codes and some their applications

Boris Melnikov, S V Pivneva, S Y Korabelshchikova, 2018, Journal of Physics: Conference Series.

Commutation in Global Supermonoid of Free Monoids

Boris Melnikov, Anna Brosalina, 2000, Informatica.

An approach to the classification of the loops of finite automata. Part II: The classification of the states based on the loops

Aleksandra Melnikova, Boris Melnikov, 2018 .

The star-height of a finite automaton and some related questions

Boris Melnikov, B. Melnikov, 2018 .

On the extension of the finite automata class for context-free languages specification

Boris Melnikov, Tatiana Generalova, Alexey Vylitok, 2018 .

Some Special Heuristics for Discrete Optimization Problems

Boris Melnikov, Alexey Radionov, Viktor Gumayunov, 2006, ICEIS.

Pseudoatuomata for generalized regular expressions

Aleksandra Melnikova, Boris Melnikov, B. Melnikov, 2018, Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications".

Some more on the equivalent transformation of nondeterministic finite automata. Part I. Notation and the "combining" algorithm

Boris Melnikov, 2019 .

Mathematical modeling of organization management by value guidelines: a method for setting optimization problems

Boris Melnikov, Tatyana Zubova, 2018 .

Waterloo-like finite automata and algorithms for their automatic construction

Boris Melnikov, Elena Melnikova, 2017 .

Extended Nondeterministic Finite Automata

Boris Melnikov, 2010, Fundam. Informaticae.

On the Algorithm for Checking the Equivalence Condition of Iterations of Finite Languages

Aleksandra Melnikova, Boris Melnikov, B. Melnikov, 2021, Informatics and Cybernetics in Intelligent Systems.

Some Properties of the Extended Basis Finite Automata

Aleksandra Melnikova, Boris Melnikov, 2021, Informatics and Cybernetics in Intelligent Systems.