Write a grammar for the language consisting of strings built only of theletters aand b. The strings may have any number of these letters, but the letter combinationsbabmust be in each stringsomewhere, and each stringmust startwithabb. For example, the strings bbababbbaa, bbbaaaababaa, and bbbabare in the language, whilea, aabb, baaa, and bbba are not.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here