☰
GkSeries.com
✕
Current Affairs
GK
Courses
Aptitude
Banking
English
UGC NET
Home
Computer Science
finite state machine can recognize
Finite State Machine can recognize
[A] only ambiguous CFG
[B] any grammar
[C] any unambiguous grammar
[D] only regular grammar
Answer & Explanation
Option: [D]
⭐ Make GKSeries Your Preferred Source on Google
Add GKSeries as Preferred Source
← Go To First Question
Go To 14 of 45 Q.→
Click Here to Read more questions