PYQBOOK
Filter Questions
Found 475 question(s)
Q471
MCQ
GATE
CS
Hard
1 Mark
2020
TOC → Context Free Language
Consider the language L = {a^n | n >= 0} U {a^n b^n | n >= 0} and the following statements. I. L is deterministic context-free. II. L is context-free but not deterministic context-free. III. L is not LL(k) for any k. Which of the above statements is/are TRUE?
Q472
MCQ
GATE
CS
Medium
1 Mark
2020
TOC → Regular Expressions
Which one of the following regular expressions represents the set of all binary strings with an odd number of 1s?
Q473
MCQ
GATE
CS
Medium
1 Mark
2020
TOC → Regular Expressions
Which one of the following regular expressions represents the set of all binary strings with an odd number of 1s?
Q474
MCQ
GATE
CS
Medium
2 Marks
2020
TOC → Computability
Which of the following languages are undecidable? Note that <M> indicates encoding of the Turing machine M. L1 = {<M> | L(M) = \emptyset}, L2 = {<M,w,q> | M on input w reaches state q in exactly 100 steps}, L3 = {<M> | L(M) is not recursive}, L4 = {<M> | L(M) contains at least 21 members}
Q475
MCQ
GATE
CS
Medium
2 Marks
2020
TOC → Computability