Deterministic Finite Automata-Introduction and Definition Online Exam Quiz
Deterministic Finite Automata-Introduction and Definition GK Quiz. Question and Answers related to Deterministic Finite Automata-Introduction and Definition. MCQ (Multiple Choice Questions with answers about Deterministic Finite Automata-Introduction and Definition
A generalization of P class can be:
Options
A : PTIME
B : DTIME
C : NP
D : None of the mentioned
Can a DFA recognize a palindrome number?
Options
A : Yes
B : No
C : Yes, with input alphabet as ?*
D : Can't be determined
If the number of steps required to solve a problem is O(nk), then the problem is said to be solved in:
Options
A : non-polynomial time
B : polynomial time
C : infinite time
D : none of the mentioned
The value of constants like p and e can be calculated in:
Options
A : polynomial time
B : non-polynomial time
C : cannot be calculated
D : none of the mentioned
What does the following figure most correctly represents?^
Options
A : Final state with loop x
B : Transitional state with loop x
C : Initial state as well as final state with loop x
D : Insufficient Data
Which of the following cannot be solved using polynomial time?
Options
A : Linear Programming
B : Greatest common divisor
C : Maximum matching
D : None of the mentioned
Which of the following is not an example of finite state machine system?
Options
A : Control Mechanism of an elevator
B : Combinational Locks
C : Traffic Lights
D : Digital Watches
Which of the following will not be accepted by the following DFA?^
Options
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
Which of the following will the given DFA won't accept?^
Options
A : ?
B : 11010
C : 10001010
D : String of letter count 11
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
CFG-Eliminating Useless Symbols
Finding Patterns in Text,Algebric Laws and Derivatives
From Grammars to Push Down Automata
Node-Cover Problem, Hamilton Circuit Problem