Design the NFAs that recognize the following languages.
L1 = {abc, abd and aacd}, assume the alphabet is {a, b, c, d}.
L2 = The set of all strings containing no four consecutive a’s and having even number of a’s & odd number of b’s defined over the alphabet {a, b}.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here