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 2009 | |||||
|---|---|---|---|---|---|
| Sec | Instructor | Description | Room Number | Time | Website |
| 1 | Ventura, Dan | Introduction to computational theory. | 3718 HBLL | 2:00-2:50p MWF | http://axon.cs.byu.edu/Dan/252 |
| 2 | Ventura, Dan | Introduction to computational theory. | 3718 HBLL | 3:00-3:50p MWF | http://axon.cs.byu.edu/Dan/252 |
| 2010 | 2011 | 2012 | 2013 | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Win | Spr | Sum | Fall | Win | Spr | Sum | Fall | Win | Spr | Sum | Fall | Win | Spr | Sum | Fall |
| Offerings from the past year | |||||
|---|---|---|---|---|---|
| Semester | Instructor | Website | |||
| Spring 2009 | Ng, Dennis | http://students.cs.byu.edu/~cs252ng/ | |||
| Winter 2009 | Goodrich, Michael A. | http://students.cs.byu.edu/~cs...inter2009/ | |||
| Winter 2009 | Ng, Dennis | http://students.cs.byu.edu/~cs252ng/ | |||
| Fall 2008 | Ventura, Dan | http://axon.cs.byu.edu/Dan/252/ | |||