Theory of Computation
| Rating: | Not rated yet |
| Rate item | |
| Type: | Course Related Materials |
| Grade Level: | Post-secondary |
Author: Shai Simonson
Subject: Science and Technology
Institution Name:
ArsDigita University
Collection Name: ArsDigita University
Abstract: A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course.
Details
Course Type: Full Course
Material Types: Homework and Assignments, Lecture Notes, Other, Readings, Syllabi, Video Lectures
Media Formats: Downloadable docs, Text/HTML, Video
Language: English
Additional Information
Geographic
Regional Relevance: All
