Assignment 1: Linux tools, regular expressions, induction
Assignment 2: Regular Languages, Context-Free Languages, Lexical analysis, Parsing, Turing machines (using Tuatara) and Quaternions
-
Notifications
You must be signed in to change notification settings - Fork 0
This unit introduces formal languages, models of computation, and computational complexity. Topics include finite state automata, regular expressions, grammars, pushdown automata, computable functions, Turing machines, polynomial-time reductions, complexity classes P and NP, and NP-completeness.
sher-loh/FIT2014-Theory-of-computation
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This unit introduces formal languages, models of computation, and computational complexity. Topics include finite state automata, regular expressions, grammars, pushdown automata, computable functions, Turing machines, polynomial-time reductions, complexity classes P and NP, and NP-completeness.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published