|
University proceedings. Volga region. Physical and mathematical sciences, 2011, Issue 4, Pages 59–69
(Mi ivpnz598)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematics
Multi-aspect minimization non-deterministic finite automata (Part I. Supporting facts and algorithms)
B. Melnikova, A. A. Melnikovab a Tolyatti State University, Tolyatti
b Dimitrovgrad branch of Ulyanovsk State University, Dimitrovgrad
Abstract:
In the first part of the article, the authors consider some auxiliary algorithms for two problems of minimization of nondeterministic finite automata: vertex-minimization and edge-minimization. The researchers give a simple algorithm for minimization of deterministic automata, which also enables simultaneous construction of state-marking functions. The article proves some auxiliary propositions about input languages of the basis automaton states, necessary for algorithms of equivalent transformation of nondeterministic finite automata.
Keywords:
nondeterministic finite automaton, basis automaton, algorithms of equivalent transformation, state-minimization, edge-minimization.
Citation:
B. Melnikov, A. A. Melnikova, “Multi-aspect minimization non-deterministic finite automata (Part I. Supporting facts and algorithms)”, University proceedings. Volga region. Physical and mathematical sciences, 2011, no. 4, 59–69
Linking options:
https://www.mathnet.ru/eng/ivpnz598 https://www.mathnet.ru/eng/ivpnz/y2011/i4/p59
|
Statistics & downloads: |
Abstract page: | 24 | Full-text PDF : | 6 | References: | 12 |
|