The powerset construction turns an NFA with state set into a DFA with state set , transition
(1)
and accepting subsets that meet the NFA final set.

Ancestors (7)

  1. Nondeterministic finite automaton
  2. Finite-state automaton
  3. Formal language theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

Incoming links (4)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version