### On the application of some heuristics in the study of the state minimization problem for nondeterministic finite automata by the branch and bound method. Part 1

#### Abstract

#### Full Text:

PDF (Russian)#### References

Abramyan M.E., Melnikov B.F. Investigation of the problem of state minimization of nondeterministic finite automata using the branch and bound method // Cloud of Science. 2020. Vol. 7, No. 2 P. 297–319 (in Russian.

Abramyan M.E. On one approach to the implementation of the branch and bound method for optimization problems // Information approaches in modeling and control: approaches, methods, solutions. Collection of scientific papers of the II Russian scientific conference with international participation. Part 1. Tolyatti, 2019. P. 56–64 (in Russian.

Aho A., Ullman J. The theory of parsing, translation, and compiling. Vol. 1. – M. : Mir Publ, 1978 (in Russian.

Jiang T., Ravikumar B. Minimal NFA problems are hard // SIAM J. Comput. 1993. Vol. 22. No. 6. P. 1117–1141.

Melnikov B.F. Multiheuristic approach to discrete optimization prob-lems // Cybernetics and Systems Analysis. 2006. Vol. 42. No. 3. P. 335–341.

Melnikov B.F., Melnikova E.A., Pivneva S.V., Dudnikov V.A., Davydova E.V. Geometric and game approaches for some discrete optimization problems // CEUR Workshop Proceedings. 2018. Vol. 2212. P. 312–321.

Melnikov B. Once more on the edge-minimization of nondeterminis-tic finite automata and the connected problems // Fundamenta Informaticae. 2010. Vol. 104. No. 3. P. 267–283.

Melnikov B.F. Regular languages and nondeterministic finite autom-ata: a monograph. – M. : RGSU Publ., 2018 (in Russian.

Melnikov B. The complete finite automaton // International Journal of Open Information Technologies. 2017. Vol. 5. No. 10. P. 9–17.

### Refbacks

- There are currently no refbacks.

Abava Кибербезопасность FRUCT 2023

ISSN: 2307-8162