10 points 3 7 given the nfa with q 1 2 3 4 a

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: recursion elimination of the productions for X . (10 points) 3 7. Given the NFA with Q = {1, 2, 3, 4}, Σ = {a, b}, q0 = 1, F = {4} and transition graph a ! 2 b 1 a a 3 ! 4 b (a) Convert the NFA to a DFA using the algorithm in the book and illustrated in class. Express your answer as a DFA transition graph. Identify the start and final states of the DFA. (10 points) (b) Prove that the DFA that you obtained is minimal. (5 points) 4 8. Consider the RE a(a|b)∗ b. (a) Use Thompson’s algorithm to construct an NFA for this RE. (10 points) (b) Convert the NFA to a DFA. (10 points) (c) Minimize the DFA. (10 points) 5 9. Consider the...
View Full Document

This note was uploaded on 02/01/2012 for the course COP 5621 taught by Professor Vanengelen during the Spring '11 term at FSU.

Ask a homework question - tutors are online