MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
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. Non-finite
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following are related to tree automaton?
Myphill Nerode does the following:
If L is DFA-regular, L is
Which of the following are non regular?
Which of the following language regular?
Which of the technique can be used to prove that a language is non regular?
All the regular languages can have one or more of the following descriptions:<br>i) DFA ii) NFA iii) e-NFA iv) Regular Expressions
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply