Question

constouet NFA for following regular expression using Thompson's rotation & then convert it into DFA. aa * (b|c)aa

Answer 1

Answer:

This method is given below: Step 1: Design a transition diagram for given regular expression, using NFA with ε moves. Step 2: Convert this NFA with ε to NFA without ε. Step 3: Convert the obtained NFA to equivalent DFA.