FAs, REs, and Regular Languages

1. Deterministic Finite Automata:
   • Material here
   • More thoughts: first Example of DFA | another first example | more on DFAs
2. Regular Expressions:
   • Material here
   • More thoughts: intro to REs | more on RE's | Kleene's theorem
3. Nondeterminism:
   • Material Here
   • More thoughts: example of nondet FA | more on nondet FA | epsilon transitions | Kleene's Theorem
4. Conversions:
   • Material here
   • More thoughts on subset const: conversion NFA to DFA | Example Subset Constr. | Neso Academy video on subset construction
   • More thoughts on RE to FA: conversion RE to FA | Example RE to FA Conversion
   • More thoughts on FA to RE: conversion FA to RE | Example FA to RE
   • More thoughts on product construction
5. Properties of Regular Languages:
   • Material here
   • More thoughts: closure properties of reg. languages | decision questions
6. Proving Languages Not Regular:
   • Material here
   • More thoughts: indistinguishable strings | the pumping lemma | Overview of Pumping Lemma
7. Applications of Finite Automata: Material
8. Summary here
9. Extension/Revision Questions:
   • Finite Automata and sols
   • Regular Languages and sols