Regular Languages and Model Theory 4: Regular Expressions
My goal with this series of videos is to demonstrate a variety of very distinct ways of characterizing regular languages, and you can't get any more distinct than between finite state automata and regular expressions.
In this video, I prove this equivalence (Kleene's Theorem) and connect regular expressions to various key concepts in the study of structures and languages: Generating a collection from a start set and a set of rules, and simplifying objects by translating them from one context to another and then translating back.
I asked on the cs theory stackexchange about translating an NFA to a regular expression and back: https://cstheory.stackexchange.com/qu...
If you have questions or something didn't make sense to you, please let me know in the comments below.