A Congruence-based Perspective on Automata Minimization Algorithms
Formal Languages and Automata Theory
2019-06-28 v2
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.
Cite
@article{arxiv.1906.06194,
title = {A Congruence-based Perspective on Automata Minimization Algorithms},
author = {Pierre Ganty and Elena Gutiérrez and Pedro Valero},
journal= {arXiv preprint arXiv:1906.06194},
year = {2019}
}
Comments
22 pages, 2 figures, accepted at MFCS 2019