Compilers Finite Automata 2 Online Exam Quiz
Compilers Finite Automata 2 GK Quiz. Question and Answers related to Compilers Finite Automata 2. MCQ (Multiple Choice Questions with answers about Compilers Finite Automata 2
Which type of string is accepted by the following finite automata?
Options
A : All string
B : Null string
C : No string
D : None of the mentioned
Which is true for in accessible state?
Options
A : It cannot be reached anytime
B : There is no necessity of the state
C : If control enters no way to come out from the state
D : If control enters FA deads
Which of the following statement is true for Dead State?
Options
A : It cannot be reached anytime
B : There is no necessity of the state
C : If control enters no way to come out from the state
D : If control enters FA deads
Myhill-Nerode Theorem is used for __________
Options
A : Minimization of DFA
B : Maximization of NFA
C : Conversion of NFA
D : Conversion of DFA
Which of the following statement is true for Moore Machine?
Options
A : Output depends on present state
B : Output depends on present input
C : Output depends on present state and present input
D : Output depends on present state and past input
Which of the following statement is true for Mealy Machine?
Options
A : Output depends on present state
B : Output depends on present input
C : Output depends on present state and present input
D : Output depends on present state and past input
In Moore Machine O/P is associated with ____________
Options
A : Present state
B : Next state
C : Input
D : None of the mentioned
In Mealy Machine O/P is associated with ____________
Options
A : Present state
B : Next state
C : Input
D : None of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Error Recovery Lr Phase 1
Compilers Error Recovery Lr Phase 2
Compilers Finite Automata Regular Expressions 1
Compilers Handle Right Sentinel Grammar 1
Compilers Implementation Translation Specified Syntax Directed Definitions Translations 1