MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
IS_THE_LANGUAGE_PRESERVED_IN_ALL_THE_STEPS_WHILE_E..
1.
IS_THE_LANGUAGE_PRESERVED_IN_ALL_THE_STEPS_WHILE_ELIMINATING_EPSILON_TRANSITIONS_FROM_A_NFA??$
A.
yes
B.
no
Answer» B. no
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