Exam-style question
Try this first
Explain what is meant by the term regular language. Include both descriptions given in the specification.
Model answer
What a good answer should say
- A regular language is a language that can be represented by a regular expression.
- It is also any language that a finite state machine will accept.
Explanation
Why this works
A complete answer must include both the regular-expression description and the finite-state-machine description. Either description identifies the language as regular within this specification.
Common mistake
No common mistake is linked to this question yet.