Automata Course

From Adam Colton
Revision as of 19:31, 11 November 2013 by 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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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