Rabin–Scott powerset construction ( NFA to DFA conversion)
Revision as of 11:33, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O({1})$ (Derived: besides the O(2^n) output nodes and the O(n) input nodes, there's nothing to store) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1959 == Reference == https://ieeexplore.ieee.org/document/5392601")
Time Complexity
$O({2}^n)$
Space Complexity
$O({1})$
(Derived: besides the O(2^n) output nodes and the O(n) input nodes, there's nothing to store)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1959