NDFA to DFA conversion algorithm

From Wikipedia, the free encyclopedia

 The introduction to this article provides insufficient context for those unfamiliar with the subject.
Please help improve the article with a good introductory style.

The NDFA to DFA conversion algorithm is used to remove non-determinism from a DFA. It is also know as the "subset method". The algorithm uses the powerset construction technique from the theory of computation.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.