Question: You may need to use the formula sheet provided for this question. Now consider a regular expression: ((xy)(xy)*l(yx)*(x)) Consider drawing the NFA of the above

You may need to use the formula sheet provided for this question. Now consider a regular expression: ((xy)(xy)*l(yx)*(x)) Consider drawing the NFA of the above regular expression using algorithm discussed in class. The NFA would contain certain number of states say P. Also, determine the number of final states and call it F1. Convert the NFA to DFA using the subset construction algorithm. Let this DFA contain Q number of states. Also, determine the number of final states and call it F2. Now, Construct the minimum-state DFA for your resultant DFA using Partitioning Algorithm. Determine the number of minimal states that you get now say R. Also, determine the number of final states and call it F3. Fill in the blanks for the values of P.Q.R and F1, F2, F3 below. You would see six consecutive blanks, please enter your answer carefully and follow the sequence of P,Q,R,F1,F2,F3. Fill the first blank for: P Fill the second blank for: Q Fill the third blank for: R AJ Fill the fourth blank for: F1 Fill the fifth blank for: F2 Fill the sixth blank for: F3 AZ Fill the first blank for: P Fill the second blank for: Q Fill the third blank for: R Fill the fourth blank for: F1 Fill the fifth blank for: F2 Fill the sixth blank for: F3
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
