Question: Which among the following is true for the given statement?^ Statement :If there are strings R and T in a language L so that R is prefix of T and R is not equivalent to T.
Options
A : No DPDA can accept L by empty stack
B : DPDA can accept L by an empty stack
C : L is regular
D : None of the mentioned
From Grammars to Push Down Automata more questions
For a counter automaton, with the symbols A and Z0,....
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 of the following can be accepted by a DPDA?
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 __
Ambiguous Grammar more Online Exam Quiz
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