A New Algorithm of Constructing the Basis Finite Automaton
Volume 13, Issue 3 (2002), pp. 299–310
Pub. online: 1 January 2002
Type: Research Article
The first author was partially supported by the Russian Foundation of the Basic Research (project No. 00-15-99253).
Received
1 January 2002
1 January 2002
Published
1 January 2002
1 January 2002
Abstract
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.