Automata Course: Difference between revisions
Jump to navigation
Jump to search
Adamcolton (talk | contribs) Created page with "== 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 i..." |
Adamcolton (talk | contribs) No edit summary |
||
| Line 14: | Line 14: | ||
* Context-free languages | * Context-free languages | ||
* Recursively enumerable languages | * Recursively enumerable languages | ||
==== Informal Introduction to Finite Automata ==== | |||
Revision as of 19:32, 11 November 2013
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