MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory Questions and Answers
→
Ambiguous Grammar in Automata Theory Questions and Answers
→
Which of the following will the given DFA won’t ..
1.
Which of the following will the given DFA won’t accept?
A.
ε
B.
11010
C.
10001010
D.
String of letter count 11
Answer» B.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following is not an example of finite state machine system?
Which of the following will the given DFA won’t accept?
Which of the following will not be accepted by the following DFA?
What does the following figure most correctly represents?
What the following DFA accepts?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply