Given the regular expression a∗(a|b)aa:
(a) Construct an equivalent NFA using the method in Sect. 1.3.
(b) Convert this NFA to a DFA using Algorithm 1.3.
Given the regular expression ((a|b)(a|bb))∗:
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here