Rabin–Scott powerset construction ( NFA to DFA conversion)

From Algorithm Wiki

Revision as of 10: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.ezproxy.canberra.edu.au/document/5392601")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Rabin–Scott_powerset_construction_(_NFA_to_DFA_conversion)&oldid=44453"