CS 252 Introduction to Computational Theory
Finite automata, regular expressions, grammars, languages, Turing machines, computability, complexity, NP. CS 236 can be taken concurrently with this course.
Course Objectives »
| Credits: | 3 |
|---|---|
| Prerequisites: | CS 236 |
| Offerings for Fall 2008 | |||||
|---|---|---|---|---|---|
| Sec | Instructor | Description | Room Number | Time | Website |
| 1 | Ventura, Dan | 3718 HBLL | 10:00-10:50a MWF | http://axon.cs.byu.edu/Dan/252/ | |
| 2 | Ventura, Dan | 3718 HBLL | 11:00-11:50a MWF | http://axon.cs.byu.edu/Dan/252/ | |
| 2009 | 2010 | ||||||
|---|---|---|---|---|---|---|---|
| Win | Spr | Sum | Fall | Win | Spr | Sum | Fall |
 |
|
 |
|
|
|
|
|