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 properties of the last object are considered. The star-height of the finite automaton is used for reformulating the star-height problem of regular expressions 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
