MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
In NFA, this very state is like dead-end non final..
1.
In NFA, this very state is like dead-end non final state:
A.
ACCEPT
B.
REJECT
C.
DISTINCT
D.
START
Answer» C. DISTINCT
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following recognizes the same formal language as of DFA and NFA?
Which of the following is a regular language?
The production of form non-terminal -> ε is called:
If L is a regular language, Lc and Lr both will be:
The number of transitions required to convert the following into equivalents DFA:
Which of the following does the given NFA represent?
Given Language:Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}How many state are required to execute L3 using NFA?
WHICH_OF_THE_FOLLOWING_IS_A_REGULAR_LANGUAGE??$
Which_of_the_following_recognizes_the_same_formal_language_as_of_DFA_and_NFA?$
The production of form non-terminal -> ε is called?#
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply