Exam-style question
Try this first
Which statement correctly defines a regular language?.
- A.A language that can be represented by a regular expression
- B.A language that must be written in Python
- C.A language that contains only numbers
- D.A language that cannot be accepted by an FSM
Model answer
What a good answer should say
- A language that can be represented by a regular expression
Explanation
Why this works
The specification states that a language is regular if it can be represented by a regular expression.
Common mistake
No common mistake is linked to this question yet.