GATE | GATE CS Mock 2018 | Question 52

Consider the following context free languages:

L1 = {0^i 1^j 2^k | i+j = k}
L2 = {0^i 1^j 2^k | i = j or j = k}
L3 = {0^i 1^j  | i = 2j+1}

Which of the following option is true?

(A) L1, L2 and L3 can be recognized by Deterministic Push down automata
(B) L1, L2 can be recognized by Deterministic Push down automata
(C) L1, L3 can be recognized by Deterministic Push down automata
(D) None of the above

Answer: (C)
Explanation: L1, L3 can be recognized by Deterministic Push down automata.

Quiz of this Question

Article Tags :

GATE

Recommended Articles

1. GATE | GATE CS Mock 2018 | Question 39

2. GATE | GATE CS Mock 2018 | Set 2 | Question 23

3. GATE | GATE CS Mock 2018 | Set 2 | Question 24

4. GATE | GATE CS Mock 2018 | Set 2 | Question 25

5. GATE | GATE CS Mock 2018 | Set 2 | Question 26

6. GATE | GATE CS Mock 2018 | Set 2 | Question 27

7. GATE | GATE CS Mock 2018 | Set 2 | Question 28

8. GATE | GATE CS Mock 2018 | Set 2 | Question 29

9. GATE | GATE CS Mock 2018 | Set 2 | Question 30

10. GATE | GATE CS Mock 2018 | Set 2 | Question 31

11. GATE | GATE CS Mock 2018 | Set 2 | Question 32

12. GATE | GATE CS Mock 2018 | Set 2 | Question 33

13. GATE | GATE CS Mock 2018 | Set 2 | Question 34

14. GATE | GATE CS Mock 2018 | Set 2 | Question 35

15. GATE | GATE CS Mock 2018 | Set 2 | Question 36

16. GATE | GATE CS Mock 2018 | Set 2 | Question 37

17. GATE | GATE CS Mock 2018 | Set 2 | Question 38

18. GATE | GATE CS Mock 2018 | Set 2 | Question 39

19. GATE | GATE CS Mock 2018 | Set 2 | Question 40

20. GATE | GATE CS Mock 2018 | Set 2 | Question 41

21. GATE | GATE CS Mock 2018 | Set 2 | Question 42

22. GATE | GATE CS Mock 2018 | Question 1

23. GATE | GATE CS Mock 2018 | Question 2

24. GATE | GATE CS Mock 2018 | Question 3

25. GATE | GATE CS Mock 2018 | Question 4