NFA to DFA conversion: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (5 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
$n$: number of states in the given NFA | |||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 20: | Line 20: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:NFA to DFA conversion - Time.png|1000px]] | [[File:NFA to DFA conversion - Time.png|1000px]] | ||
Latest revision as of 09:07, 28 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
