MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory Questions and Answers
→
Ambiguous Grammar in Automata Theory Questions and Answers
→
If L is DFA-regular, L’ is..
1.
If L is DFA-regular, L’ is
A.
Non regular
B.
DFA-regular
C.
Non-finite
D.
None of the mentioned
Answer» C.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Finite state machine are not able to recognize Palindromes because:
Myphill Nerode does the following:
Which of the following options is incorrect?
If L is DFA-regular, L’ is
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply