Time Left - 15:00 mins
GATE 2024 Theory of computation Foundation Quiz 89
Attempt now to get your rank among 47 students!
Question 1Multiple Correct Options
Let L1 = {0n 1m |n ≤ m} and L2 = {0n 1m, n > m} be two context free language which of the following is correct?
Question 2
The simplified grammar for the given context-free grammar is
S → A | ABa | AbA
A → Aa | ϵ
B → Bb | BC
C → CB | CA | bB
Question 3
Consider the following PDA
Which of the following language is accepted by given PDA?
Question 4
Consider the following PDA :
Which of the following languages is represented by the above PDA?
Question 5
Consider the following PDA that accepts a language 
Match the following groups for above PDA
Group-I
A) W
B) X
C) Y
D) Z
Group-II
1. cb
2.
3. b
4. A
Match the following groups for above PDA
Group-I
A) W
B) X
C) Y
D) Z
Group-II
1. cb
2.
3. b
4. A
- 47 attempts
- 0 upvotes
- 0 comments
Jun 9GATE & PSU CS
