A Congruence-based Perspective on Automata Minimization Algorithms
classification
💻 cs.FL
keywords
automataalgorithmsautomatoncomputingcongruence-basedconstructionsdeterministicequivalences
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.