Register

GATE CSE 2025 | Set 2 | Question: 14

1,533 views
2 2 votes

Which ONE of the following languages is accepted by a deterministic pushdown automaton?

  1. Any regular language.
  2. Any context-free language.
  3. Any language accepted by a non-deterministic pushdown automaton.
  4. Any decidable language.

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · GATE CSE 2025 | Set ...Next → · GATE CSE 2025 | Set ...
← Previous in category · Peter Linz 2 chapter...Next in category → · GATE CSE 2025 | Set ...
Position:
Show:

Related questions

3 3 votes
0 0 answers
387
387 views
Deepak Poonia asked Nov 20, 2024
387 views
Peter Linz Edition 6 Exercise 7.3 Question 14 (Page No. 207)
Show that $L = \{a^nb^m,n< 2m \}$ is a deterministic context-free language.
14 14 votes
4 4 answers
6.6k
6.6k views
Arjun asked Feb 27, 2025
6,579 views
GATE CSE 2025 | Set 2 | Question: 14
​​​​Which ONE of the following languages is accepted by a deteministic pushdown automaton?Any regular languageAny context-free languageAny language accepted by a non-dete...
0 0 votes
0 0 answers
776
776 views
Guilherme Zanini Mor asked Dec 12, 2018
776 views
Draw PDA for this
L = { a^m b^n c^k=m+n } Please draw PDA for this Language!
0 0 votes
1 1 answer
1.2k
1.2k views
Abhisek Tiwari 4 asked Nov 6, 2018
1,175 views
Push Down Automata
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack ThenA)Ldf proper subset of Lef.B)Ldf = Lef.C)Lef ...