MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
State true or false:
Statement: Both NFA and e-..
1.
State true or false:
Statement: Both NFA and e-NFA recognize exactly the same languages.
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Design a NFA for the language:<br>L: {an| n is even or divisible by 3}
State true or false:<br>Statement: Both NFA and e-NFA recognize exactly the same languages.
The number of final states we need as per the given language?<br>Language L: {an| n is even or divisible by 3}
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply