|
University proceedings. Volga region. Physical and mathematical sciences, 2012, Issue 1, Pages 31–43
(Mi ivpnz506)
|
|
|
|
Mathematics
Multidimensional minimization of nondeterministic finite automata (Part II. Basic algorithms)
B. Melnikova, A. A. Melnikovab a Tolyatti State University, Tolyatti
b Dimitrovgrad branch of Ulyanovsk State University, Dimitrovgrad
Abstract:
In the second part of this paper the authors consider the detailed example of construction of binary relation # and the set of grids of the given regular language; this construction is made in the process of canonization of an automaton defining this language. The article considers two algorithms of combining states of nondeterministic automaton. Based on these algorithms, the researchers formulate a brief algorithm of the edge-minimization, and also an algorithm for adding an edge.
Keywords:
nondeterministic finite automaton, basis automaton, algorithms of equivalent transformation, state-minimization, edge-minimization.
Citation:
B. Melnikov, A. A. Melnikova, “Multidimensional minimization of nondeterministic finite automata (Part II. Basic algorithms)”, University proceedings. Volga region. Physical and mathematical sciences, 2012, no. 1, 31–43
Linking options:
https://www.mathnet.ru/eng/ivpnz506 https://www.mathnet.ru/eng/ivpnz/y2012/i1/p31
|
Statistics & downloads: |
Abstract page: | 23 | Full-text PDF : | 6 | References: | 17 |
|