Talk:Nondeterministic finite state machine/Proofs

Talk:Nondeterministic finite state machine/Proofs

An introduction
This article essentially is the mathematical version of the article Powerset construction. In the article Powerset construction, you use a specific machine and one particular input string to illustrate the technique of constructing a DFA from a given NFA. This approach, although easier to understand, is not acceptable as a rigorous argument for proving the universal truth of a statement. This article provides a proof of the statement without referencing to any particular machine or input string.

--CBKAtTopsails (talk) 17:28, 26 November 2007 (UTC)