The meaning of each regular expression _ is a language _(_) ___* whose definition parallels the inductive definition of the syntax.
Basis case(s): (a) _(_) = _ (b) _(_) = {_} (c) _(_) = {_}
Inductive case(s): If _ and _ are regular expressions, then: (a) _(_ + _) = _(_) _ _(_) (b) _(_ • _) = _(_) • _(_) (c) _(_*) = (_(_))*
| Previous slide | Next slide | Back to first slide | View graphic version |