Can I read Converting ϵNFAs to DFAs on EtoBox?

Converting ϵNFAs to DFAs by Quincy Sproul is a document available to read on EtoBox.

What is Converting ϵNFAs to DFAs about?

This document discusses converting epsilon nondeterministic finite automata (eNFAs) to deterministic finite automata (DFAs). It introduces the concept of the epsilon-closure of a state, which is the set of states reachable from that state by epsilon transitions. To convert an eNFA to an equivalent NFA without epsilon transitions, each state is replaced by its epsilon-closure. This resulting NFA can then be converted to an equivalent DFA using the standard subset construction method. An example conversion is

Author

Quincy Sproul

Language

EN