Exam-style question
Try this first
A language is represented by a regular expression. What can be concluded from this information?.
- A.The language is regular
- B.The language is not regular
- C.The language cannot be accepted by an FSM
- D.The language must be implemented in C#
Model answer
What a good answer should say
- The language is regular
Explanation
Why this works
The specification directly states that a language is called regular if it can be represented by a regular expression.
Common mistake
No common mistake is linked to this question yet.