Time Left - 15:00 mins
GATE 2024 theory of computation Booster Quiz 12
Attempt now to get your rank among 33 students!
Question 1
Consider the following grammar :
S → ABa / aAb / aC
A → aB / 
B → bA / 
C → a/b
Identify the grammar after eliminating null productions ?
Question 2
Consider the following PDA state transition function
δ (q1,a,z0) = (q1,az0)
δ (q1,a,a) = (q1,aa)
δ (q1,b,a) = (q2,€)
δ (q2,b,a) = (q2,€)
δ (q2,c,a) = (q3,€)
δ (q3,c,a) = (q3,€)
δ (q3,€,z0) = (qf,z0)
where initial states ={q1}, states={q1,q2,q3,qf}, final state={qf} and stack alphabet={a,b,c,z0}.find the language satisfy by the above given state transition function.
Question 3
A language accepted by a pushdown automaton in which stack size is limited to 100 is best described as?
Question 4
Which of the following language is not CFL?.
Question 5
The Greibach normal form grammar for the language L = {an bn+1 | n ≥ 0 } is?
Question 6
Find the grammar that generates an inherently ambiguous context free language.
Question 7
Consider the following PDA.
Identify the language accepted by the above PDA?
- 33 attempts
- 0 upvotes
- 0 comments
Nov 21GATE & PSU CS
