Register

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

FSM can recognize a) Any grammar b)Only CFG c)Any unambiguous grammar d)Only regular grammar
53.4k views
2 votes
FSM can recognize

a) Any grammar
b)Only CFG
c)Any unambiguous grammar
d)Only regular grammar

User Keyoke
by
8.1k points

2 Answers

2 votes

Answer:

The answer is D

User Kasaname
by
8.9k points
3 votes
FSM can recognize :
D. only regular grammar

that's why Gramamers are defined as regular if there is an FSM that can recognize them

hope this helps
User Bogdan Farca
by
8.2k points
← Prev Question Next Question →

Related questions

User Yitz
asked Jul 23, 2024 36.0k views
Draw the finite state machine (FSM) for the receiver side of protocol rdt3.0.
Yitz asked Jul 23, 2024
by Yitz
8.8k points
1 answer
4 votes
36.0k views
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories

Other Questions

Passe para a voz passiva: - Kevin asked Dennis a question -Somebody Build the house last year -She gives him a box
why is mercury usually hard to see without a telescope?
If you are writing a persuasive essay in favor of banning vending machines in schools, which is a counterargument you might anticipate?
Link Copied!