MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Automata Theory
→
Non Deterministic Turing Machines
→
An e-NFA is ___________ in representation.
1.
An e-NFA is ___________ in representation.
A.
Quadruple
B.
Quintuple
C.
Triple
D.
None of the mentioned
Answer» C. Triple
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
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies