MCQOPTIONS
Bookmark
Saved Bookmarks
→
Compilers
→
Cross Compiler
→
A finite automata recognizes
1.
A finite automata recognizes
A.
Any Language
B.
Context Sensitive Language
C.
Context Free Language
D.
Regular Language
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
A finite automata recognizes
The string WWR is not recognized by any FSM because
Basic limitations of finite state machine is
Maximum number of states of a DFA converted from a NFA with nstates is
The transitional function of a DFA is
A language L from a grammar G = { VN, Σ, P, S} is
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies