gs gs101 Push Down Automata - Deterministic PDA - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Push Down Automata. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: The transition a Push down automaton makes is additionally dependent upon the:
stack
input tape
terminals
none of the mentioned
Question 2: A PDA machine configuration (p, w, y) can be correctly represented as:
(current state, unprocessed input, stack content)
(unprocessed input, stack content, current state)
(current state, stack content, unprocessed input)
none of the mentioned
Question 3: |-* is the __________ closure of |-
symmetric and reflexive
transitive and reflexive
symmetric and transitive
none of the mentioned
Question 4: With reference of a DPDA, which among the following do we perform from the start state with an empty stack?
process the whole string
end in final state
end with an empty stack
all of the mentioned
Question 5: A DPDA is a PDA in which:
No state p has two outgoing transitions
More than one state can have two or more outgoing transitions
Atleast one state has more than one transitions
None of the mentioned
Question 6: State true or false:
Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
Given a grammar G, construct the PDA and show the equivalence
Given a PDA, construct a grammar and show the equivalence
Question 7: If the PDA does not stop on an accepting state and the stack is not empty, the string is:
rejected
goes into loop forever
all of the mentioned
none of the mentioned
Question 8: A language accepted by Deterministic Push down automata is closed under which of the following?
Complement
Union
All of the mentioned
None of the mentioned
Question 9: Which of the following is a simulator for non deterministic automata?
JFLAP
Gedit
FAUTO
None of the mentioned
Question 10: Finite-state acceptors for the nested words can be:
nested word automata
push down automata
ndfa
none of the mentioned
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
