View/Download
A theoretical treatment of what can be computed and how fast it can bedone. Applications to compilers, string searching, and control circuitdesign will be discussed. The hierarchy of finite state machines,pushdown machines, context free grammars and Turing machines will beanalyzed, along with their variations. The notions of decidability,complexity theory and a complete discussion of NP-Complete problemsround out the course.Added by ruthless on 2007-02-02 13:12:48
View/Download