# From Grammars to Push Down Automata Online Exam Quiz

From Grammars to Push Down Automata GK Quiz. Question and Answers related to From Grammars to Push Down Automata. MCQ (Multiple Choice Questions with answers about From Grammars to Push Down Automata

### A DFA cannot be represented in the following format

**Options**

A : Transition graph

B : Transition Table

C : C code

D : None of the mentioned

### A Language for which no DFA exist is a__

**Options**

A : Regular Language

B : Non-Regular Language

C : May be Regular

D : Cannot be said

### For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form of __

**Options**

A : A

B : AnZ0, n>=0

C : Z0An, n>=0

D : None of the mentioned

### Let ?={0,1}* and the grammar G be:^ S->?^ S->SS^ S->0S1|1S0^ State which of the following is true for the given

**Options**

A : Language of all and only Balanced strings

B : It contains equal number of 0's and 1's

C : Ambiguous Grammar

D : All of the mentioned

### State true or false:^ Statement: Counter Automaton can exist for the language L={0i1i|i>=0}

**Options**

A : TRUE

B : FALSE

C : -

D : -

### 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

### When are 2 finite states equivalent?

**Options**

A : Same number of transitions

B : Same number of states

C : Same number of states as well as transitions

D : Both are final states

### 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

### 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

### Which of the following not an example Bounded Information?

**Options**

A : fan switch outputs {on, off}

B : electricity meter reading

C : colour of the traffic light at the moment

D : none of the mentioned

### 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