GATE Computer Science (CS) 2021 Shift 1 Solved Paper
© examsiri.com
Question : 61 of 65
Marks:
+1,
-0
In a pushdown automaton P = (Q, ∑, Γ, δ, q0, F), a transition of the form,
where p, q ∈ Q, a ∈ Σ ∪ {ϵ}, and X, Y ∈ Γ ∪ {ϵ}, represents
(q, Y) ∈ δ(p, a, X).
Consider the following pushdown automaton over the input alphabet ∑ = {a, b} and stack alphabet Γ = {#, A}.
The number of strings of length 100 accepted by the above pushdown automaton is ______
where p, q ∈ Q, a ∈ Σ ∪ {ϵ}, and X, Y ∈ Γ ∪ {ϵ}, represents
(q, Y) ∈ δ(p, a, X).
Consider the following pushdown automaton over the input alphabet ∑ = {a, b} and stack alphabet Γ = {#, A}.
The number of strings of length 100 accepted by the above pushdown automaton is ______
- Your Answer:
Go to Question: