info@avatto.com
+91-9920808017
11. Define for the context free language L< {0;1} init (L) = { u | u v ε L for some v in {0, 1}} If L { w | w is nonempty and has an equal number of 0's and 1's}, then init (L) is set of all binary strings
with unequal numbers of 0's and 1's.
including the null string.
Both (a) and (b)
None of these
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
12. Which of the following CFG's can't be simulated by an FSM?
s ---> sa | a
s ---> abX , X --> cY, Y --> a | axY
s ---> a sb | ab
none of these
13. Basic limitation of FSM is that it
cannot remember arbitrary large amount of information
sometimes fails to recognize grammars that are regular
sometimes recognizes grammars are not regular
14. Which of the following is not possible algorithmically?
Regular grammar to context free grammar
Non-deterministic FSA to deterministic FSA
Non-deterministic PDA to deterministic PDA
15. The set {anbn | n = 1, 2, 3 ...} can be generated by the CFG
S → ab | aSb
S → aaSbb + abS
S → ab | aSb | E
S → aaSbb | ab | aabb
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