Assertion: the regular languages are the smallest family of languages containing the finite languages and closed under union, concatenation, and star.
Assertion: a regular expression denotes an infinite language only if it includes *, and _(_*) is infinite unless _ _ _ or _ _ _.
| Previous slide | Next slide | Back to first slide | View graphic version |