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
Give a production grammar that specified language L = {ai b2i >= 1}:
Consider the production of the grammar S->AA A->aa A->bb.Describe the language specified by the production grammar.
Regular expressions are closed under
L and ~L are recursive enumerable then L is
Regular expression are
Which of the following is not a regular expression?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply