The basis automaton for the given regular language

A new problem of the theory of finite automata (Rabin-Scott’s automata) is considered. So called basis automaton for the given regular languageL is defined. This automaton is unique for the givenL, it is defined by two automata of canonical form: forL and for its inverse languageL ^R. Some properties of basis automata are considered. Such properties make these automata most convenient for using in some special tasks, dealing with the given regular language.