Journal of applied mathematics & informatics

  • 제6권2호
  • /
  • Pages.379-392
  • /
  • 1999
  • /
  • 2734-1194(pISSN)
  • /
  • 2234-8417(eISSN)
한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

A NEW ALGORITHM OF THE STATE-MINIMIZATION FOR THE NONDETERMINISTIC FINITE AUTOMATA

  • Melnikov, B.F. (Department of Mechanics and Mathematics Simbiirsk State University)
  • 발행 : 1999.06.01

⟨ 이전 논문 다음 논문 ⟩

초록

The problem of the state-minimization for the nonde-terministic finite Rabin-Scott's automata is considered. A new algo-rithm for this problem is obtained. The obtained algorithm has the exponential effectiveness like the earlier-known algorithms for this problem. But each of previous algo-rithms amounts to the search of minimum generative system for local reaction of equal automaton of canonical form and unlike them we use in this paper two special function marking states of the given automaton.

키워드

참고문헌

  1. IEEE Trans. on Computers v.C-19 On the state minimization of nondeterministic finite automata T.Kameda;P.Weiner
  2. Bonn v.33 Zur Zustandsminimisierung nichtdeterministischer endicher Automaten, Berichte der Gesellschaft fur Mathematik und Datenverarbeitung K.Indermark
  3. IBM T.J. Watson Research Center Yorktown Heights RC 4896 State Minimization of Nondeterministic Machines J.Kim.
  4. B.G.Teubner Stuttgart Automatentheorie. Eine Einfuhrung in die Theorie endlicher Automaten W.Brauer
  5. The Korean Journal of Computational and Applied Mathematics v.5 no.3 Some more on the finite automata B.Melnikov;A.Vakhitova
  6. Finite Automata. Handbook of Theoret. Comput. Sci. D.Perrin
  7. Programmirovanie(Russian Academy of sciences Ed.) Applying the finite automata in various tasks of the formal languages theory B.Melnikov;A.Vakhitova