Question: What the following DFA accepts?^
Options
A : x is a string such that it ends with '101'
B : x is a string such that it ends with '01'
C : x is a string such that it has odd 1's and even 0's
D : x is a strings such that it has starting and ending character as 1
From Grammars to Push Down Automata more questions
A DFA cannot be represented in the following format
A Language for which no DFA exist is a__
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....
When are 2 finite states equivalent?
Which among the following is true for the given statement?^....
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.
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