Journal of applied mathematics & informatics

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

THE BASIS AUTOMATON FOR THE GIVEN REGULAR LANGUAGE

  • Vakhitova, A.A. (Department of Applied Mathematics, Dimitrovgrad branch of Simbirsk Polytechnik University)
  • Published : 1999.09.01

⟨ Previous Next ⟩

Abstract

A new problem of the theory of finite automata (Rabin-Scott's automata) is considered. So called basis automaton for the given regular language l is defined. this automaton is unique for the given L, it is defined by two au-tomata of canonical form: for L and for its inverse language LR. Some properties of basis automata are considered. Such properties make these automata most convenient for using in some special tasks dealing with the given regular language.

Keywords

References

  1. Eine Einfuhrung in die Theorie endlicher Automaten Automatentheorie W.Brauer
  2. The Korena Journal of Computational and Applied Mathematics v.5 no.3 Some more on the finite automata B.Melnikov;A.Vakhitova
  3. The Korean Journal of Computational and Applied Mathematics A new algorithm of the state-minimization for the nondeterministic finite automata B.Melnikov