Pub. online:1 Jan 2002Type:Research ArticleOpen Access
Volume 13, Issue 3 (2002), pp. 299–310
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.