GATE CSE · 2023 · CS
Question 40: Theory of Computation
Give it a try, then reveal the answer to check your work.
Question 40
CSMCQ2 marksNeeds review
Consider the pushdown automaton (PDA)
below, which runs on the input alphabet
, has stack alphabet
, and has three states
, with
being the start state. A transition from state
to state
, labelled
, where
is an input symbol or
,
is a stack symbol, and
is a string of stack symbols, represents the fact that in state
, the PDA can read
from the input, with
on the top of its stack, pop
from the stack, push in the string
on the stack, and go to state
. In the initial configuration, the stack has only the symbol
in it. The PDA accepts by empty stack.Which one of the following options correctly describes the language accepted by
? 
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2023CS
GATE CSE 2023 · Paper 1
Computer Science and Information Technology · Original paper archive
- Section
- Computer Science and Information Technology
- Question type
- Multiple choice (MCQ)
- Marks
- 2 marks
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
computer science
GATE CSE previous year questions
information technology
GATE CSE previous year questions
computing
GATE CSE previous year questions
theory computation
GATE CSE previous year questions
Theory of Computation
GATE CSE previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.