21. L = (an bn an | n = 1,2,3) is an example of a language that is
not context free
not context free but whose complement is CF
both (B) and (C)
You must be logged in to post a comment.
22. If Σ = (0, 1), L = Σ* and R = (0n 1nsuch that n > 0)
then languages L ∪ R and R respectively are
Regular, Not regular
Not regular, Not regular
None of these
23. FSM can recognize
Both (A) and (B)
only regular grammar
24. Set of regular languages over a given alphabet set is closed under
All of these
25. Which of the following statement is correct?
All languages can not be generated by CFG
Any regular language has an equivalent CFG
Some non regular languages can't be generated by CFG
UGC NET PAPER 1
UGC NET Management
UGC NET COMPUTER SCIENCE
UGC NET COMMERCE
GATE COMPUTER SCIENCE
CFA Level 1
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