L ___* is a regular language if there exists a regular expression _ so that L = _(_)
Regular expressions _ and _ are equivalent, _ ___ , provided that _(_) = _(_)
To avoid excessive parentheses in regular expressions, we assign precedence to the operations: * highest, • intermediate, and + lowest; also, • may be omitted. For instance, the regular expression (0•(1*)) is written 01*.
| Previous slide | Next slide | Back to first slide | View graphic version |