Question: 1) For the language L over {a,b,c} defined by the regular expression (a+b)*(b+c)*(c+a)* a) Find the shortest word not in L. b) Draw an NFA
1) For the language L over {a,b,c} defined by the regular expression (a+b)*(b+c)*(c+a)* a) Find the shortest word not in L. b) Draw an NFA that accepts L informally (without using Thompson's Construction Algorithm). c) Draw a DFA that accepts L.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
