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...

Deskribapen osoa

Xehetasun bibliografikoak

Egile nagusia:	M.E. Abramyan
Formatua:	Artigo
Hizkuntza:	Inglês
Argitaratua:	Penza State University Publishing House 2021-09-01
Saila:	Известия высших учебных заведений. Поволжский регион: Физико-математические науки
Gaiak:	nondeterministic finite automata minimization branch and bound method heuristic algorithm implementation
Etiketak:	Etiketa erantsi Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!