Review for the First Quiz

What regular languages are; what properties they have; and how do we
represent them? We have three basic regular operators: Union (represented as U
or +);; Concatenation (sometimes represented as . , but it is often omitted);;
Kleene star ( represented as *). How to convert Regular Expressions to Finite
Automata ...

Part of the document