CONSTRUCTION OF BASIS AND COMPLETE AUTOMATA USING ReFaM

  • Andrey Vladimirovich Tsyganov

Abstract

Basis and complete automata are invariants of a regular language which are used in nondeterministic finite automata minimization algorithms. In the present paper we consider algorithms for constructing basis and complete automata which are implemented in a software tool for minimizing nondeterministic finite automata called ReFaM. We provide the description of the algorithms as well as the results of the numerical experiments.
Section
Technical Sciences