|
|
|
|
|
Mikhail Abramyan,Boris Melnikov
Pág. 1 - 7
We consider the problem of state minimization of nondeterministic finite automata. One of the ways to solve it is to analyze a subset of the set of states of two canonical automa-ta constructed on the basis of the initial nondeterministic finite automato...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mikhail Abramyan,Boris Melnikov
Pág. 1 - 9
We continue to study heuristics that can be applied to solve the problem of minimizing the states of nondeterministic finite automata by the branch and bound method, or rather, to the implementation of the most difficult stage of the solution associated ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Anastasia Nichiporchuk,Marina Trenina,Mikhail Abramyan
Pág. 1 - 8
In discrete optimization problems, we apply algorithms based on extensions of the branch and bound method. These extensions consist in the joint work of several auxiliary heuristic algorithms, they can be referred to different, independent from each othe...
ver más
|
|
|
|
|
|