Page
%P
1 Result(s)
within
Heiko Körner
Computer Science
-
Chapter and Conference Paper
On Minimizing Cover Automata for Finite Languages in O(n log n) Time
A deterministic finite automaton (DFA) A is called a cover automaton (DFCA) for a finite language L over some alphabet σ if L = L(A) ∩ σ≤l, with l being the length of some longest word in L. Thus a word w ∈ σ* is...
