Rabin–Scott powerset construction ( NFA to DFA conversion): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3310:33, 15 February 2023‎ Admin talk contribs‎ 368 bytes +368‎ 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"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Rabin–Scott_powerset_construction_(_NFA_to_DFA_conversion)"