MCQOPTIONS
Bookmark
Saved Bookmarks
→
Compilers
→
Cross Compiler in Compilers
→
L and ~L are recursive enumerable then L is?..
1.
L and ~L are recursive enumerable then L is?
A.
Regular
B.
Context free
C.
Context sensitive
D.
Recursive
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Regular expressions are closed under _____________
L and ~L are recursive enumerable then L is?
Regular expression is __________
Which of the following is not a regular expression?
Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then?
What is Regular grammar?
A language is regular if and only if?
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply