Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

Use the properties of finite automata in algorithms of state-minimization

Annotation

with the help of the basis automata, we consider the properties of nondeterministic finite Rabin-Scott's (Medvedev's) automata for using heuristic algorithms in task of the state-minimization for the finite automata.

Keywords

nondeterministic finite automata; basis automaton; state minimization; discrete optimization; heuristic algorithms

Full-text in one file

Download

UDC

517.713

Pages

763-765

Section of issue

Articles

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.