Exam-style question
Try this first
Which statement expresses the FSM characterisation of a regular language?.
- A.Every language accepted by an FSM is regular
- B.Every language accepted by an FSM is non-regular
- C.An FSM can accept only programming languages
- D.An FSM is used to write regular expressions
Model answer
What a good answer should say
- Every language accepted by an FSM is regular
Explanation
Why this works
The specification states that a regular language is any language that an FSM will accept.
Common mistake
No common mistake is linked to this question yet.