Article ID Journal Published Year Pages File Type
437843 Theoretical Computer Science 2015 8 Pages PDF
Abstract

In this paper, we show the relationship between the two most widely used approaches for the minimization of deterministic finite automata: minimization by split of partitions and minimization by double reversal. Even though the double reversal approach has usually been considered to be unconventional with respect to the more common split approach, we show that any double reversal minimization algorithm can be related to a split minimization algorithm and vice versa.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , ,