[SOLVED] CS154-HW2-an NFA with no more than 3 states to accept L' Solved     

Given L = {aⁿb : n ≥ 0} over Σ = {a, b}.

Design an NFA with no more than 3 states to accept L’ where L’ = L (L ⋃ {λ})

1. Solve the problem using the provided JFLAP in the Canvas
2. Save it as: First_Name.Last_Name.List_Num.jff

If your first or last name has more than one part, hyphenate them and  don’t use underscore. (e.g.: ahmad.yazdan-khah.1.jff)

Also note that my fake list number is written as ‘1’, not ’01’.