Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
The set of strings accepted by a finite state machine M is called or denoted by
L(M)
the legal strings of M
the legitimate strings in M
the alphabet of M
the language of M
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!