Career Mentorship Colloquium Details
ACM Student Lecture Series: Regular Expressions, Finite State Machines and Transition Systems, Oh My!
| Author: | Jim Allen UO CIS Alum |
|---|---|
| Date: | June 04, 2012 |
| Time: | 15:30 |
| Location: | 100 Deschutes |
Abstract
Every modern computer language has regular expressions. We will explore the mathematical foundations, uses and syntax of regular expressions and similar transition systems. We will use Python to solve various problems using regular expressions, and we will talk about using transition systems to reason about program correctness.