MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
The number of final states we need as per the give...
1.
The number of final states we need as per the given language?
A.
B.
1
C.
2
Answer» C. 2
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
IS_THE_LANGUAGE_PRESERVED_IN_ALL_THE_STEPS_WHILE_ELIMINATING_EPSILON_TRANSITIONS_FROM_A_NFA??$
An e-NFA is ___________ in representation.
The number of final states we need as per the given language?
Which of the following does not belong to input alphabet if S={a, b}* for any language?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies.
Cookie Policy
Reject
Allow cookies
