Automata Course
Video Lectures
Week 1
Course Outline and Motivation
One of the highest ranked courses at Standford for "most used" after 5 years of employement.
Used in regex and modeling electronics. We will cover context-free grammars.
Some problems are undecidable or intractable and automata can help identify them and help avoid sinking time into them.
We will look at
- Regular languages
- Context-free languages
- Recursively enumerable languages