(Homework) Converting an NFA to a DFA with a lambda transition, but no
transition for some a in the alphabet
If my alphabet is {a,b} and my nfa has a state q0 with the following
transition:
State | a b (no input)
--------------------------------------------
q0 q1 null q1
Is this table wrong? should delta(q0, b) = q1 because q0 can move on (no
input) to state q1?
No comments:
Post a Comment