Journal of applied mathematics & informatics

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

POSSIBLE EDGES OF A FINITE AUTOMATON DEFINING A GIVEN REGULAR LANGUAGE

  • Melnikov, B.F. (Department of Information Technologies, Simbirsk State University) ;
  • Sciarini Guryanova, N.V. (Department of Linguistics, Simbirsk State University)
  • Published : 2002.05.01

⟨ Previous Next ⟩

Abstract

In this Paper we consider non-deterministic finite Rabin-Scott's automata. We define special abstract objects, being pairs of values of states-marking functions. On the basis of these objects as the states of automaton, we define its edges; the obtained structure is considered also as a non-deterministic automaton. We prove, that any edge of any non-deterministic automaton defining the given regular language can be obtained by such techniques. Such structure can be used for solving various problems in the frames of finite automata theory.

Keywords

References

  1. Automatentheorie. Eine Einfuhrung in die Theorie endlicher Automaten W.Brauer
  2. The Korean 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 v.6 no.2 A new algorithm of the state-minimization for the nondeterministic finite automata B.Melnikov
  4. 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
  5. Jewels of the formal languages theory A.Salomaa
  6. Finite Automata. Handbook of Theoret. Comput. Sci. D.Perrin
  7. The Korean Journal of Computational and Applied Mathematics v.6 no.3 The basis automation for the given regular language A.Vakhitova