You do not have permission to edit this page, for the following reason:
The action you have requested is limited to users in one of the groups: Users, Administrators.
You can view and copy the source of this page.
Return to Category:Automata Theory Notes.
Video Lectures by Shai Simonson
NP Complete
Recursively Enumerable Sets
Notes from CMU
Definitions
Push Down Automata
Linear Bounded Automata
Turing Machine Problems
Turing Machine Handout
Reduction examples for decidablility
Rice's theorem, Undecidable and unrecognizable problems on TM
Undecidable problems about L(CFG)
Trivial and Non-trivial properties of L(M)
Undecidable Problems
Closure property of CFL
A good lecture going deep into Abstract Machines
P, NP, NPC and NP-Hard in SImple terms
Identify the class of the language