Automata Theory Non Deterministic Finite Automata Introduction Online Exam Quiz
Automata Theory Non Deterministic Finite Automata Introduction GK Quiz. Question and Answers related to Automata Theory Non Deterministic Finite Automata Introduction. MCQ (Multiple Choice Questions with answers about Automata Theory Non Deterministic Finite Automata Introduction
If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?
Options
A : 1/m2
B : 2m
C : 1/m
D : log m
If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ?
Options
A : 64
B : 32
C : 128
D : 127
An automaton that presents output based on previous state or current input:
Options
A : Acceptor
B : Classifier
C : Transducer
D : None of the mentioned.
Which of the following option is correct?
Options
A : NFA is slower to process and its representation uses more memory than DFA
B : DFA is faster to process and its representation uses less memory than NFA
C : NFA is slower to process and its representation uses less memory than DFA
D : DFA is slower to process and its representation uses less memory than NFA
The construction time for DFA from an equivalent NFA (m number of node)is:
Options
A : O(m2)
B : O(2m)
C : O(m)
D : O(log m)
NFA, in its name has ’non-deterministic’ because of :
Options
A : The result is undetermined
B : The choice of path is non-deterministic
C : The state to be transited next is non-deterministic
D : All of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Lexical Analysis
Automata Theory Markup Languages
Automata Theory Multistack Machines Counter Machines
Automata Theory Multitape Turing Machine
Automata Theory Non Deterministic Polynomial Time