MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory Questions and Answers
→
Ambiguous Grammar in Automata Theory Questions and Answers
→
ε- closure of q1 in the given transition graph:..
1.
ε- closure of q1 in the given transition graph:
A.
{q1}
B.
{q0, q2}
C.
{q1, q2}
D.
{q0, q1, q2}
Answer» D.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The e-NFA recognizable languages are not closed under :
For NFA with ε-moves, which among the following is correct?
Predict the total number of final states after removing the ε-moves from the given NFA?
ε- closure of q1 in the given transition graph:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply