MCQOPTIONS
Bookmark
Saved Bookmarks
→
Compilers
→
Cross Compiler in Compilers
→
The relation between NFA-accepted languages and DF..
1.
The relation between NFA-accepted languages and DFA accepted languages is
A.
>
B.
<
C.
=
D.
<=
Answer» D. <=
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
In regular expressions, the operator ‘*’ stands for$
The relation between NFA-accepted languages and DFA accepted languages is
For any DFA state {qi,qj…qm} If some qj is a final state in the NFA Then {qi,qj…qm}, is a final state in the DFA.True or False$
The behaviour of a NFA can be stimulated by DFA
Regular expression a/b denotes the set
Find the wrong statement?
Can a DFA simulate NDFA
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply