Computing the weight of subtasks in state minimization of nondeterministic finite automata by the branch and bound method
Background. The study considers various aspects of constructing iterative anytime algorithms for solving the problem of state minimization of nondeterministic finite automata. Although this problem was posed back in the 60s of the 20th century, it is NP-hard; therefore, the development of efficie...
| Published in: | Известия высших учебных заведений. Поволжский регион: Физико-математические науки |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Penza State University Publishing House
2021-09-01
|
| Subjects: |