GATE | GATE CS 1999 | Question 6

Let L_D be the set of all languages accepted by a PDA by final state and L_F the set of all languages accepted by empty stack. Which of the following is true?

(A) a
(B) b
(C) c
(D) d

Answer: (A)
Explanation:
Quiz of this Question

Article Tags :

GATE

GATE-GATE CS 1999

Recommended Articles

1. GATE | GATE CS 1999 | Question 36

2. GATE | GATE CS 1999 | Question 26

3. GATE | GATE CS 1999 | Question 27

4. GATE | GATE CS 1999 | Question 28

5. GATE | GATE CS 1999 | Question 29

6. GATE | GATE CS 1999 | Question 30

7. GATE | GATE CS 1999 | Question 31

8. GATE | GATE CS 1999 | Question 32

9. GATE | GATE CS 1999 | Question 57

10. GATE | GATE CS 1999 | Question 56

11. GATE | GATE CS 1999 | Question 48

12. GATE | GATE CS 1999 | Question 49

13. GATE | GATE CS 1999 | Question 1

14. GATE | GATE CS 1999 | Question 2

15. GATE | GATE CS 1999 | Question 3

16. GATE | GATE CS 1999 | Question 4

17. GATE | GATE CS 1999 | Question 5

18. GATE | GATE CS 1999 | Question 7

19. GATE | GATE CS 1999 | Question 8

20. GATE | GATE CS 1999 | Question 9

21. GATE | GATE CS 1999 | Question 10

22. GATE | GATE CS 1999 | Question 11

23. GATE | GATE CS 1999 | Question 12

24. GATE | GATE CS 1999 | Question 13

25. GATE | GATE CS 1999 | Question 14