NFA to DFA conversion: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| 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]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:NFA to DFA conversion - Space.png|1000px]] | [[File:NFA to DFA conversion - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:NFA to DFA conversion - Pareto Frontier.png|1000px]] | [[File:NFA to DFA conversion - Pareto Frontier.png|1000px]] | ||
Revision as of 13:04, 15 February 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
Pareto Frontier Improvements Graph
