Multiple Choice
Which of the following problems are decidable?
1) Does a given program ever produce an output?
2) If L is a context-free language, then is L' (complement of L) also context-free?
3) If L is a regular language, then is L' also regular?
4) If L is a recursive language, then, is L' also recursive?
A) 1, 2, 3, 4
B) 1, 2
C) 2, 3, 4
D) 3, 4
Correct Answer:
Verified
Correct Answer:
Verified
Q14: Let L<sub>1</sub> be a recursive language, and
Q15: Definition of a language L with alphabet
Q16: Let L<sub>1</sub> be a regular language, L<sub>2</sub>
Q17: Consider the regular language L =(111+11111)*. The
Q18: Consider the languages: GATE[2005]L<sub>1</sub> = {wwR w
Q20: Which of the following languages is regular?<br>A){WW^R
Q21: Let L = L<sub>1</sub> \cap L<sub>2</sub>, where
Q22: Consider the following Finite State Automaton The
Q23: Let L={w \in (0 + 1)*|w has
Q24: Let w be any string of length