Ask your own question, for FREE!
Computer Science 19 Online
OpenStudy (anonymous):

FSM can recognize a) Any grammar b)Only CFG c)Any unambiguous grammar d)Only regular grammar

OpenStudy (anonymous):

a) any grammar

OpenStudy (anonymous):

i think it's a regular grammar u need a turing machine to accept "any grammar"!!!

OpenStudy (anonymous):

sorry, i think i gave a wrong answer. Avinash is correct, it's regular grammar. Here is the link: http://www.cs.hmc.edu/~keller/cs60book/12%20Finite-State%20Machines.pdf

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!