A new algorithm of constructing the basis finite automaton
In this paper we consider non-deterministic finite Rabin-Scott's automata. We obtain some properties for the basis automaton, which is, like automaton of canonical form, an invariant of a given regular language. We obtain also a new algorithm of constructing the basis automaton for a given regular language.
regular languages basis finite automata