摘要：In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
关键词：Double-Reversal Method; Minimization; Automata; Congruences; Regular Languages
