MCQOPTIONS
Bookmark
Saved Bookmarks
→
Discrete Mathematics
→
Inference in Discrete Mathematics
→
In lexical analysis of a compiler______ is used...
1.
In lexical analysis of a compiler______ is used.
A.
DFA
B.
NDFA
C.
NFA
D.
Turing machine
Answer» B. NDFA
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
In lexical analysis of a compiler______ is used.
In the operating system, newly started processes can have a start in the _________
Equivalence of automata states that ____________
Which of the following techniques refer to the equivalence of DFA and N-DFA automata?
A deterministic automaton system can have ______ transition for a given state of an input symbol.
Optimisation of an FSM machine can be done by ________
In system engineering which of the following methods bridges the gap between the two ends of system development?
Which of the following is not a member of the set of a deterministic finite state machine?
Which of the following algorithms transforms any NFA into its identical DFA?
How many states are there in combinatorial FSM?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply