question archive 1) a) Construct a λ-NFA for the regular expression ((a*b)*c)* Show intermediate stages for each Kleene star
1) a) Construct a λ-NFA for the regular expression ((a*b)*c)* Show intermediate stages for each Kleene star
Subject:Computer SciencePrice: Bought3
1) a) Construct a λ-NFA for the regular expression
((a*b)*c)*
Show intermediate stages for each
Kleene star.
b) Build an NFA from the
λ-NFA obtained from the above by first constructing the transitive closure of λ-moves.
You may simplify the λ-NFA first, stating the rules you use. Draw the result or give a transition table.
c)Using the subset construction, build and draw a DFA from the NFA obtained at the previous point
d)Using the state elimination construction, find a regular expression from the produced minimal DFA, and argue it is equivalent to the initial regular expression.
