info@avatto.com
+91-9920808017
0. Consider the following grammar S --> Ax / By A --> By/Cw B --> x / Bw C--> y Which of the regular expressions describe the same set of strings as the grammar ?
xw * y + xw * yx + ywx
xwy + xw * xy + ywx
xw * y + xw x yx + ywx
xw xy + xww * y + ywx
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.