A Congruence-based Perspective on Automata Minimization Algorithms

Pierre Ganty, Elena Gutiérrez, Pedro Valero

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment