On the Transition Reduction Problem for Finite Automata
Mohamed Dahmoune, El Houcein El Abdalaoui, Djelloul Ziadi · Fundamenta Informaticae · 2014
In this paper we apply the concept of common follow sets (CFS) of a regular expression to homogeneous finite state automaton. Based on this concept and using particular binary trees, we devise an efficient algorithm to reduce (minimize) the number of