NFA to DFA conversion: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
n: number of states in the given NFA | $n$: number of states in the given NFA | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 08:52, 10 April 2023
Description
Convert a given nondeterministic finite automota (NFA) to a deterministic finite automota (DFA).
Parameters
$n$: number of states in the given NFA
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Rabin–Scott powerset construction | 1959 | $O({2}^n)$ | $O({1})$ | Exact | Deterministic | Time |
Time Complexity Graph
Space Complexity Graph
Time-Space Tradeoff
