NFA to DFA conversion

Convert a given nondeterministic finite automota (NFA) to a deterministic finite automota (DFA).

Parameters

  • nn: number of states in the given NFA

Related Problems

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 1 of 1 algorithms

See more
Rabin–Scott powerset construction1959O(2n)O(2^n)O(1)O(1)

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table