Edge-minimization of non-deterministic finite automata

Abstract

In this paper we consider non-deterministic finite Rabin-Scott’s automata. We use a special structure to describe all the possible edges of non-deterministic finite automaton defining the given regular language. Such structure can be used for solving various problems of finite automata theory. One of these problems is edge-minimization of non-deterministic automata. As we have not touched this problem before, we obtain here two versions of the algorithm for solving this problem to continue previous series of articles.