Question: Compiler Construction NFA -> DFA State a b S0 S1,S2 S3 S0 S1 S3 S2 S1 S2 S3 S3 1. Given the NFA shown below
Compiler Construction
NFA -> DFA
| State | a | b | |
| S0 | S1,S2 | S3 | S0 |
| S1 | S3 | ||
| S2 | S1 | S2 | |
| S3 | S3 |
1. Given the NFA shown below construct an equivalent DFA, assuming S0 is the initial state and S3 is the final state.
2. Are there any indistinguishable states in this DFA? If so identify a pair.
3. Are there any distinguishable states in this DFA? If so identify a pair and give what distinguishes them.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
