Cyclic Nontrivial SCCs DFA Minimization (DFA Minimization)
Jump to navigation
Jump to search
Description
Given an finite deterministic automaton (DFA) from a class $C$ of DFAs, whose nontrivial SCCs are cyclic, determine its minimal automaton given by the equivalence relation on states.
Related Problems
Generalizations: DFA Minimization
Related: Acyclic DFA Minimization
Parameters
$n$: number of states
$d$: number of transitions
$k$: size of alphabet
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Almeida & Zeitoun | 2008 | $O(n)$ | $O(n)$ | Exact | Deterministic | Time & Space |
Time Complexity Graph
