Acyclic DFA Minimization: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 30: | Line 30: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:DFA Minimization - Acyclic DFA Minimization - Time.png|1000px]] | [[File:DFA Minimization - Acyclic DFA Minimization - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:DFA Minimization - Acyclic DFA Minimization - Space.png|1000px]] | [[File:DFA Minimization - Acyclic DFA Minimization - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:DFA Minimization - Acyclic DFA Minimization - Pareto Frontier.png|1000px]] | [[File:DFA Minimization - Acyclic DFA Minimization - Pareto Frontier.png|1000px]] | ||
Revision as of 14:04, 15 February 2023
Description
Given an acyclic finite deterministic automaton (DFA) from a class $C$ of DFAs, determine its minimal automaton given by the equivalence relation on states.
Related Problems
Generalizations: DFA Minimization
Related: Cyclic Nontrivial SCCs 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 |
|---|---|---|---|---|---|---|
| Revuz's algorithm | 1992 | $O(n)$ | $O(n)$ | Exact | Deterministic | Time & Space |
Time Complexity Graph
Space Complexity Graph
Pareto Frontier Improvements Graph
