info@avatto.com
+91-9920808017
41. Context free grammar is not closed under
product
union
complementation
kleen star
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
42. If L be a language recognizable by a finite automaton, then language front {L} = { w such that w is prefix of v where v ∈ L }, is a
regular language
context-free language
context-sensitive language
recursive enumeration language
43. For which of the following application, regular expressions can not be used?
Designing computers
Designing compilers
Both (A) and (B)
Developing computers
44. 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
45. Which of the following statements is (are) correct?
Recursive languages are closed under complementation.
If a language and its complement are both regular, the language is recursive
Set of recursively enumerable language is closed under union
All of these
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