Automata Theory Exercise Solutions
Automata Theory Exercise Solutions
q₁ ∅ {q₀, q₂}
q₂ ∅ {q₁, q₂}
Note: → indicates initial state, * indicates accepting state, ∅ represents empty set
b) Trace all computations of the string aabb in M
Step 1: Start at initial state q₀
Read 'a': From q₀ with 'a' → {q₀, q₁}
Current state set: {q₀, q₁}
Step 2: Process second symbol 'a' from states {q₀, q₁}
From q₀ with 'a' → {q₀, q₁}
From q₁ with 'a' → ∅
Current state set: {q₀, q₁}
Step 3: Process third symbol 'b' from states {q₀, q₁}
From q₀ with 'b' → ∅
From q₁ with 'b' → {q₀, q₂}
Current state set: {q₀, q₂}
Step 4: Process fourth symbol 'b' from states {q₀, q₂}
From q₀ with 'b' → ∅
From q₂ with 'b' → {q₁, q₂}
Final state set: {q₁, q₂}
c) Is aabb in L(M)?
Since the final state set {q₁, q₂} contains accepting states (both q₁ and q₂ are accepting states), the
string "aabb" IS ACCEPTED by the NFA and is in L(M).