COURSE DESCRIPTION
The course covers four broad areas: (1) Finite automata and regular expressions, (2) Context-free grammars, (3) Turing machines and decidability, and (4) the theory of intractability, or NP-complete problems.
Length: 6 Weeks
Effort: 8-10 hours per week
Price: FREE
Provider: Stanford University
Subject: Computer Science
Level: Intermediate
Languages: English
Instructors: Jeffrey Ullman
[parsehtml]<a class="button" style="height: 100%; padding:14px 14px 14px 14px !important; color: white; font-size: 18px; font-weight: bold; margin-bottom: 10px;" href="https://online.stanford.edu/courses/soe-ycsautomata-automata-theory"target="_blank">> Go To Course</a>[/parsehtml]
The course covers four broad areas: (1) Finite automata and regular expressions, (2) Context-free grammars, (3) Turing machines and decidability, and (4) the theory of intractability, or NP-complete problems.
Length: 6 Weeks
Effort: 8-10 hours per week
Price: FREE
Provider: Stanford University
Subject: Computer Science
Level: Intermediate
Languages: English
Instructors: Jeffrey Ullman
[parsehtml]<a class="button" style="height: 100%; padding:14px 14px 14px 14px !important; color: white; font-size: 18px; font-weight: bold; margin-bottom: 10px;" href="https://online.stanford.edu/courses/soe-ycsautomata-automata-theory"target="_blank">> Go To Course</a>[/parsehtml]