Pushdown Automata | Excellent Question - GATE Sol | TOC | Computer Science Engineering

Consider the transition diagram of a PDA given below with input alphabet Σ = {a, b} and stack alphabet Γ = {X, Z}. Z is the initial stack symbol. Let L denote the language accepted
by the PDA

Which one of the following is TRUE?
(A) L = {anbn|n ≥ 0} and is not accepted by any finite automata
(B) L = {an|n ≥ 0} ∪{anbn|n ≥ 0} and is not accepted by any deterministic PDA
(C) L is not accepted by any Turing machine that halts on every input
(D) L = {an|n ≥ 0} ∪{anbn|n ≥ 0} and is deterministic context-free

THE GATE ACADEMY provide comprehensive and rigorous coaching for the GATE exams. Our student-centered guidance focuses on the strengths and weaknesses of each student. This has enabled us to achieve a proven track record of GATE toppers from our institute. THE GATE ACADEMY appreciates diversity in requirements and hence have tailor-made digital & distance learning courses for addressing these different needs.

Classroom Course- The most popular course, classroom lecture is blended with GATE focused books and digital resources such as video lectures and online tests.

tabGATE- We tied up with Samsung to take care of students who want to study anywhere, anytime.

homeGATE- Live online GATE lectures, specially designed for students who stay away from city centers and still don’t want to lose on live faculty teaching with doubt clearing.

Correspondence Course- Comprises hard-copy GATE focused books options of Tests and video lectures. Its popular amongst self-preparing GATE aspirants.

SD Card / USB GATE- Can be used on windows desktop/laptop/Android phone. Students who want to self-pace their studies, from the convenience of their home, will use this option.

For more details, visit our website and social handles as below.

Call us at 080-61766222

Do not Forget to watch the videos of below-mentioned subjects :