ii) Provide the corresponding quintuple and state transition table for the NFA.

Reminder: the
state transition table columns represent non-overlapping components of the language
alphabet (i.e. any shortcuts/notations used to group components of the alphabet must be
done very carefully).

Q = finite set of states = {q1, q2, q3, q4, q5, q6, q7, q8, q9, q10 , q11}

∑ = non-empty finite set of symbols called as input alphabets = {w, h, i, l, e, (, ) , :}

q0 ∈ Q is the initial state = {q1}

F ⊆ Q is a set of final states {q9, q10, q11, R}

δ w h i l e ( ) : α β
q1 q2,R ∅ ∅ ∅ ∅ ∅ ∅ ∅ ∅ ∅
q2 ∅ q3,R ∅ ∅ ∅ ∅ ∅ ∅ ∅ ∅
q3 ∅ ∅ q4,R ∅ ∅ ∅ ∅ ∅ ∅ ∅
q4 ∅ ∅ ∅ q5,R ∅ ∅ ∅ ∅ ∅ ∅
q5 ∅ ∅ ∅ ∅ q6,R ∅ ∅ ∅ ∅ ∅
q6 ∅ ∅ ∅ ∅ ∅ q6,q7, ∅ ∅ q7 ∅
R
q7 ∅ ∅ ∅ ∅ ∅ ∅ q7,q8, q8 q8 ∅
R
q8 ∅ ∅ ∅ ∅ ∅ ∅ q8,q9 q9,R ∅ q9
q9 ∅ ∅ ∅ ∅ ∅ ∅ q10 q10 R q10
q10 ∅ ∅ ∅ ∅ ∅ ∅ ∅ ∅ ∅ q11,R
q11 ∅ ∅ ∅ ∅ ∅ ∅ ∅ ∅ ∅ ∅