| __[No title]__ *(Site not responding. Last check: 2007-10-30)* |

| | **Regular** Expressions, **Languages**, and Grammars A class of **languages** called **“regular** **languages”** is of interest to us. |

| | There are 3 ways to describe a **regular** **language**: **regular** expression the set containing the elements in the **language** **regular** grammar **Regular** Expressions We can construct **regular** expressions from primitive constituents by repeatedly applying recursive rules: Let A be a given alphabet. |

| | These are primitive **regular** expressions if w1 and w2 are **regular** expressions, then w1(w2, w1 (w2, w1*, and (w1) are **regular** expressions a string is a **regular** expression if and only if it can be derived from the primitive **regular** expressions by a finite number of applications of the rules in (2). |

| www.utdallas.edu /~kcooper/teaching/2305/FSA/FSA.doc (1170 words) |