We show that inserting a new string σ∈Σ k or deleting a string from the set S represented as a minimized DFA can be done in expected time O(k|Σ|), while preserving the minimality of the DFA. The method can be applied to reduce the memory requirements of model checkers that are ...
Namely, we present an O ( n log n ) algorithm that computes for a given deterministic finite automaton (dfa) an almost-equivalent dfa that is as small as possible—such an automaton is called hyper-minimal. Here two finite automata are almost-equivalent if and only if the symmetric ...
We improve a recent result [A. Badr: Hyper-Minimization in O(n~2). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finite automata. Namely, we present an O(n log n) algorithm that computes for a given finite deterministic automaton (dfa) an almost equivalent dfa that is as ...