Below is the description of an NFA N. Convert it to a NFA that recognizes Drop(L(N)) N: states = {a,b,c,d} input_alphabet
The post DFA to drop NFA first appeared on COMPLIANT PAPERS.

Below is the description of an NFA N.
Convert it to a NFA that recognizes Drop(L(N))

N:

states = {a,b,c,d}
input_alphabet = {0,1}
start_state = b
accept_states = {b}
delta =
a,1 -> {c,d};
a, -> a;
b,1 -> c;
c,0 -> b;
c, -> b;
d,1 -> b;

The post DFA to drop NFA first appeared on COMPLIANT PAPERS.