Rabin–Scott powerset construction ( NFA to DFA conversion)
Jump to navigation
Jump to search
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.ezproxy.canberra.edu.au/document/5392601