# NFA to DFA conversion (NFA to DFA conversion)

(Redirected from Family:NFA to DFA conversion)

Jump to navigation
Jump to search
## Description

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

## Parameters

$n$: number of states in the given NFA

## Table of Algorithms

Name | Year | Time | Space | Approximation Factor | Model | Reference |
---|---|---|---|---|---|---|

Rabin–Scott powerset construction | 1959 | $O({2}^n)$ | $O({1})$ | Exact | Deterministic | Time |