Compilers Finite Automata 1 Online Exam Quiz
Compilers Finite Automata 1 GK Quiz. Question and Answers related to Compilers Finite Automata 1. MCQ (Multiple Choice Questions with answers about Compilers Finite Automata 1
The string WWR is not recognized by any FSM because _____________
Options
A : An FSM cannot remember arbitrarily large amount of information
B : An FSM cannot fix the midpoint
C : An FSM cannot match W with WR
D : An FSM cannot remember first and last inputs
A finite automata recognizes ____________
Options
A : Any Language
B : Context Sensitive Language
C : Context Free Language
D : Regular Language
What are the basic limitations of finite state machine?
Options
A : It cannot remember arbitrarily large amount of information
B : In cannot remember state transitions
C : In cannot remember grammar for a language
D : It cannot remember language generated from a grammar
Maximum number of states of a DFA converted from an NFA with nstates is?
Options
A : n
B : n2
C : 2n
D : None of the mentioned
What is the transitional function of a DFA?
Options
A : Q X ??Q
B : Q X ??2Q
C : Q X ??2n
D : Q X ??Qn
What is the transitional function of an NFA?
Options
A : Q X ??Q
B : Q X ??2Q
C : Q X ??2n
D : Q X ??Qn
A language L from a grammar G = { VN, ?, P, S} is?
Options
A : Set of symbols over VN
B : Set of symbols over ?
C : Set of symbols over P
D : Set of symbols over S
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Data Structure Representing Parsing Table 1
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