A Congruence-based Perspective on Automata Minimization Algorithms
arXiv:1906.06194
Abstract
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.
22 pages, 2 figures, accepted at MFCS 2019