Journal of applied mathematics & informatics

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

SOME MORE ON THE FINITE AUTOMATA

  • Melnikov, B.F. (Department of Mecanics and Mathematics Simbirsk State University) ;
  • Vakhitova, A,A. (Department of Applied Mathematics Branch of Simbirsk Polytekhnik University)
  • Published : 1998.09.01

⟨ Previous Next ⟩

Abstract

Some new problems of the theory of the finite automata are considered. Applying the finite automata in various tasks of the formal languages theory is observed. Special proof of Kleene's theorem is obtained. This proof is used for the defining the star-height of the finite automaton. The proper-ties of the last object are considered. The star-height of the finite automaton is used for reformulating the star-height problem of regular expression for finite automata. The method of the reduction of the star-height problem to the task of making special finite automaton is obtained. This reformulating can help to solve the star-height problem by new way.

Keywords

References

  1. Compilers: principles, techniques and tools A.V.Aho;R.Sethi;J.D.Ullman
  2. The theory of parsing, translation and compiling. V.1: Parsing A.Aho;J.Ullman
  3. Automatentheorie. Eine Einf$\"{u}$hrung in die Theorie endlicher Automaten B.G.Teubner Stuttgart W.Brauer
  4. Inform. Comput. v.78 Algorithms for determining relative star height and star height K.Hashiguchi
  5. Vestnik Moskovskogo Universiteta, ser.15 v.3 On the classification of sequential context-free languages and grammars B.Melnikov
  6. Finite Automata. Handbook of Theoret. Comput.Sci. D.Perrin
  7. Jewels of the formal languages theory Salomaa
  8. Algorithms + data structures = programs N. Wirth
  9. Algorithmes + data structures = programs N.Wirth