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 _____________
What are the basic limitations of finite state machine?
Maximum number of states of a DFA converted from an NFA with nstates is?
What is the transitional function of an NFA?
What is the transitional function of a DFA?
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