MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
State true or false:Statement: Both NFA and e-NFA..
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
State true or false:Statement: Both NFA and e-NFA recognize exactly the same languages.
An e-NFA is ___________ in representation.
The e-NFA recognizable languages are not closed under :
Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
The __________ of a set of states, P, of an NFA is defined as the set of states reachable from any state in P following e-transitions.
e-transitions are
The automaton which allows transformation to a new state without consuming any input symbols:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply