Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

EDGE-MINIMIZATION OF NON-DETERMINISTIC FINITE AUTOMATA

  • Melnikov, B.F. (Department of Mechanics and Mathematics, Simbirsk State University) ;
  • Melnikova, A.A. (Department of Economics, Dimitrovgrad Branch of simbirsk State University)
  • Published : 2001.09.01

⟨ Previous Next ⟩

Abstract

In this paper we consider non-deterministic finite Rabin-Scott’s automata. We use a special structure to descibe all the possible edges of non-determinstic finite automaton defining the given regular language. Such structure can be used for solving various problems of finite automata theory. One of these problems is edge-minimization of non-deterministic automata. As we have not touched this problem before, we obtain here two versions of the algorithm for solving this problem to continue previous series of articles.

Keywords

References

  1. The Korean Journal of Computational and Applied Mathematics v.5 no.3 Some more on the finite automata B.Melnikov;A.Vakhitova
  2. The Korean Journal of Computational and Applied Mathematics v.6 no.2 A new algorithm of the state-minimization for the nondeterministic finite automata B.Melnikov
  3. The Korean Journal of Computational and Applied Mathematics v.7 no.3 Once more about the state-minimization of the nondeterministic finite automata B.Melnikov
  4. The Korean Journal of Computational and Applied Mathematics(to appear) Possible edges of a finite automaton defining the given regular language B.Melnikov;N. Sciarini-Guryanova
  5. Automatentheorie. Eine EinfEinf$\"{u}$hrung in die Theorie endlicher Automaten W.Brauer
  6. ICALP Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language K.Hashiguchi
  7. The Korean Journal of Computational and Applied Mathematics v.6 no.3 The basis automaton for the given regular language A.Vakhitova