Open AccessComputing the weight of subtasks in state minimization of nondeterministic finite automata by the branch and bound method
Author(s) -
Mikhail Abramyan
Publication year - 2021
Publication title -
izvestiâ vysših učebnyh zavedenij. povolžskij region. fiziko-matematičeskie nauki
Language(s) - English
Resource type - Journals
ISSN - 2072-3040
DOI - 10.21685/2072-3040-2021-2-4
Subject(s) - nondeterministic algorithm , nondeterministic finite automaton , minification , automaton , finite state machine , computer science , branch and bound , dfa minimization , state (computer science) , deterministic finite automaton , upper and lower bounds , finite state , algorithm , mathematics , theoretical computer science , automata theory , programming language , machine learning , markov chain , mathematical analysis