Test: From PDA To Grammars


10 Questions MCQ Test Theory of Computation | Test: From PDA To Grammars


Description
This mock test of Test: From PDA To Grammars for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 10 Multiple Choice Questions for Computer Science Engineering (CSE) Test: From PDA To Grammars (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: From PDA To Grammars quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: From PDA To Grammars exercise for a better result in the exam. You can find other Test: From PDA To Grammars extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

The instantaneous PDA is has the following elements

Solution:

The instantaneous description of a PDA is represented by 3 tuple:
(q,w,s)
where q is the state, w is the unconsumed input and s is the stack content.

QUESTION: 2

The moves in the PDA is technically termed as:

Solution:

: A turnstile notation is used for connecting pairs od ID’s taht represents one or many moves of a PDA.

QUESTION: 3

 

Which of the following option resembles the given PDA?
 

Solution:
QUESTION: 4

 Which of the following correctly resembles the given state diagram?

Solution:
QUESTION: 5

Which of the following assertion is false?

Solution:

All the assertions mentioned are theorems or corollary.

QUESTION: 6

A push down automata can represented using:

Solution:

Yes, a PDA can be represented using a transition diagram, transition table and an instantaneous description.

QUESTION: 7

tate true or false:Statement: Every context free grammar can be transformed into an equvalent non deterministic push down automata.

Solution:

Push down automata is the automaton machine for all the context free grammar or Type 2 languages.

QUESTION: 8

Which of the following statement is false?

Solution:

Geraud proved the equivalence problem decidable for Deterministic PDA .

QUESTION: 9

Which of the following are the actions that operates on stack top?

Solution:

 Push, pop and replace are all the basic and only operations that takes place on stack top.

QUESTION: 10

A push down automata is said to be _________ if it has atmost one transition around all configurations.

Solution:

 DPDA or Deterministic Push down automata has atmost one transition applicable to each configuration.

Related tests