Automata Theory Deterministic Pda Online Exam Quiz
Automata Theory Deterministic Pda GK Quiz. Question and Answers related to Automata Theory Deterministic Pda. MCQ (Multiple Choice Questions with answers about Automata Theory Deterministic Pda
A PDA machine configuration (p, w, y) can be correctly represented as:
Options
A : (current state, unprocessed input, stack content)
B : (unprocessed input, stack content, current state)
C : (current state, stack content, unprocessed input)
D : none of the mentioned
A language accepted by Deterministic Push down automata is closed under which of the following?
Options
A : Complement
B : Union
C : Both (a) and (b)
D : None of the mentioned
Which of the following is a simulator for non deterministic automata?
Options
A : JFLAP
B : Gedit
C : FAUTO
D : None of the mentioned
Finite-state acceptors for the nested words can be:
Options
A : nested word automata
B : push down automata
C : ndfa
D : none of the mentioned
A DPDA is a PDA in which:
Options
A : No state p has two outgoing transitions
B : More than one state can have two or more outgoing transitions
C : Atleast one state has more than one transitions
D : None of the mentioned
With reference of a DPDA, which among the following do we perform from the start state with an empty stack?
Options
A : process the whole string
B : end in final state
C : end with an empty stack
D : all of the mentioned
If the PDA does not stop on an accepting state and the stack is not empty, the string is:
Options
A : rejected
B : goes into loop forever
C : both (a) and (b)
D : none of the mentioned
The transition a Push down automaton makes is additionally dependent upon the:
Options
A : stack
B : input tape
C : terminals
D : none of the mentioned
|-* is the __________ closure of |-
Options
A : symmetric and reflexive
B : transitive and reflexive
C : symmetric and transitive
D : none of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Chomsky Normal Form
Automata Theory Construction Yield Parse Tree
Automata Theory Context Free Grammar Derivations Definitions
Automata Theory Converting Regular Expressions Automata
Automata Theory Dfa Processing Strings
Automata Theory Dfa Regular Expressions
Automata Theory Dpda Ambiguous Grammars