Test: PDA-Acceptance By Final State


10 Questions MCQ Test Theory of Computation | Test: PDA-Acceptance By Final State


Description
This mock test of Test: PDA-Acceptance By Final State 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: PDA-Acceptance By Final State (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: PDA-Acceptance By Final State quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: PDA-Acceptance By Final State exercise for a better result in the exam. You can find other Test: PDA-Acceptance By Final State extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

 A push down automaton employs ________ data structure.

Solution:

A push down automata uses a stack to carry out its operations. They are more capable than the finite automatons but less than the turing model.

QUESTION: 2

State true or false:Statement: The operations of PDA never work on elements, other than the top.

Solution:

 The term pushdown refers to the fact that the elements are pushed down in the stack and as per the LIFO principle, the operation is always performed on the top element of the stack.

QUESTION: 3

 Which of the following allows stacked values to be sub-stacks rather than just finite symbols?

Solution:

In computational theory, a nested stack automaton is a finite automaton which makes use of stack containing data which can be additional stacks.

QUESTION: 4

A non deterministic two way, nested stack automaton has n-tuple definition. State the value of n.

Solution:

The 10-tuple can be stated as: NSA= ‹Q,Σ,Γ,δ,q0,Z0,F,[,],]›.

QUESTION: 5

Push down automata accepts _________ languages.

Solution:

 Push down automata is for Context free languages and they are termed as Type 2 languages according to Chomsky hierarchy.

QUESTION: 6

The class of languages not accepted by non deterministic, nonerasing stack automata is _______

Solution:

: NSPACE or non deterministic space is the computational resource describing the memory space for a non deterministic turing machine.

QUESTION: 7

A push down automaton with only symbol allowed on the stack along with fixed symbol.

Solution:

This class of automata can recognize a set of context free languages like {anbn|n belongs to N}

*Multiple options can be correct
QUESTION: 8

 Which of the operations are eligible in PDA?

Solution:

Push and pop are the operations we perform to operate a stack. A stack follows the LIFO principle, which states its rule as: Last In First Out.
Explanation: When we reach the acceptance state and find the stack to be empty, we say, the string has been accepted by the push down automata.

QUESTION: 9

 A string is accepted by a PDA when

Solution:

When we reach the acceptance state and find the stack to be empty, we say, the string has been accepted by the push down automata.

QUESTION: 10

The following move of a PDA is on the basis of:

Solution:

The next operation is performed by PDA considering three factors: present state,symbol on the top of the stack and the input symbol.

Related tests