Introduction to the Theory of Computation
Introduction to the Theory of Computation
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Introduction to Algorithms
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Incremental construction of minimal deterministic finite cover automata
Theoretical Computer Science - Implementation and application of automata
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science
Better hyper-minimization: not as fast, but fewer errors
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
| Hi-index | 0.00 |
Two formal languages are f-equivalentif their symmetric difference L1茂戮驴 L2is a finite set -- that is, if they differ on only finitely many words. The study of f-equivalent languages, and particularly the DFAs that accept them, was recently introduced [1]. First, we restate the fundamental results in this new area of research. Second, our main result is a faster algorithm for the natural minimization problem: given a starting DFA D, find the smallest (by number of states) DFA D茂戮驴 such that L(D) and L(D茂戮驴) are f-equivalent. Finally, we present a technique that combines this hyper-minimizationwith the well-studied notion of a deterministic finite cover automaton[2---4], or DFCA, thereby extending the application of DFCAs from finite to infinite regular languages.