Regular Languages Lecture

Date:: March 6th, 2025

Synopsis

Regular languages and languages that can be recognized with only a finite amount of memory and no backtracking. They correspond to right linear gramamrs.

A very useful application of this is in lexing and searching.

Videos

• Regular Languages
• Right Linear Grammars

Handouts

• Regular Expression Activity (POGIL)

Further Reading

• Regular Expression Crossword Puzzle
• Regular Expression Matching Can be Simple and Fast Surprisingly, many programming languages do regex matching wrong.