☰
GkSeries.com
✕
Current Affairs Quiz 2025
GK
Courses
Aptitude
Banking
English
UGC NET
Close the sidebar
Ad
Home
/
Computer Science
/
finite state machine can recognize
By
Gkseries
see more questions
Ad
Q.
Finite State Machine can recognize
[A] only ambiguous CFG
[B] any grammar
[C] any unambiguous grammar
[D] only regular grammar
Answer & Explanation
Option: [D]
← Go To First Question
Go To 14 of 45 Q.→
Click Here to Read more questions