Problem 3 (10 marks) Convert the following NFA with ε-transitions into an equivalent DFA. Show ε-closures and the subset construction table. (Provide a small NFA diagram such as states q0,q1,q2, transitions: q0 —ε→ q1, q1 —0→ q1, q1 —1→ q2, q2 —0→ q2; start q0, accept q2.)
Detailed coverage of Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata (NFA), including their applications and conversions (NFA to DFA). Regular Languages: finite automata and formal languages by padma reddy pdf