Question: Which of the following can be accepted by a DPDA?

Options

A : The set of even length palindrome over {a,b}

B : The set of odd length palindrome over {a,b}

C : {xxc| where c stands for the complement,{0,1}}

D : None of the mentioned

Click to view Correct Answer

Exam Quiz App on Google Play

Previous || Next

From Grammars to Push Down Automata more questions

Let ?={0,1}* and the grammar G be:^ S->?^ S->SS^ S->0S1|1S0^....

State true or false:^ Statement: Counter Automaton can exist for....

What the following DFA accepts?^

When are 2 finite states equivalent?

Which among the following is true for the given statement?^....

Which of the following not an example Bounded Information?

Fibonacci number falls in the category of ___ combinatorics.

Hamilton circuit problem can have the following version/s as per....

Hamilton Circuit problem is a special case of __

State true or false:^ Statement: Hamiltonian cycles through any fixed....

Ambiguous Grammar more Online Exam Quiz

Applications of NFA

Applications of Pumping Lemma/Pigeonhole principle

CFG-Eliminating Useless Symbols

Deterministic Finite Automata-Introduction and Definition

Finding Patterns in Text,Algebric Laws and Derivatives

Node-Cover Problem, Hamilton Circuit Problem

Problem Solvable in Polynomial Time

Properties-Non Regular Languages

Regular Language & Expression - 1

Turing Machine-Notation and Transition Diagrams