View source for Category:Automata Theory Notes ← Category:Automata Theory Notes

[http://www.youtube.com/playlist?list=PL601FC994BDD963E4 Video Lectures by Shai Simonson]

[http://www.ecst.csuchico.edu/~amk/foo/csci356/notes/ch11/NP2.html NP Complete]

[http://csfundas.wordpress.com/theory-of-computation-2/recursively-enumerable Recursively Enumerable Sets]

[http://www.seas.upenn.edu/~cit596/notes/dave/relang0.html Recursively Enumerable Sets]

[http://www.cs.cmu.edu/~eugene/teach/auto01/notes/ Notes from CMU]

[http://carlstrom.com/stanford/comps/Automata-and-Formal-Languages.txt Definitions]

[http://www.cs.ucr.edu/~jiang/cs150/slides4week7_PDA+EquivToCFG.pdf Push Down Automata]

[http://courses.engr.illinois.edu/cs373/sp2009/lectures/lect_25.pdf Linear Bounded Automata]

[http://www.cs.cornell.edu/Courses/cs4820/2013sp/Handouts/TMproblems.pdf Turing Machine Problems]

[http://www.cs.cornell.edu/Courses/cs4820/2013sp/Handouts/481TM.pdf Turing Machine Handout]

[http://theory.stanford.edu/~trevisan/cs154-12/rice.pdf Rice's theorem, Undecidable and unrecognizable problems on TM]

[http://www.cis.upenn.edu/~jean/gbooks/PCPh04.pdf Undecidable problems about L(CFG)]

[http://courses.engr.illinois.edu/cs373/fa2013/Lectures/lec25.pdf Trivial and Non-trivial properties of L(M)]

[http://www.cs.wcupa.edu/~rkline/fcs/grammar-undecidable.html Undecidable Problems]

[http://infolab.stanford.edu/~ullman/ialc/spr10/slides/cfl5.pdf Closure property of CFL]

[http://www.cs.cmu.edu/~avrim/451f11/lectures/lect1108.pdf NP Complete]

[http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Algorithms-with-Yuri-Gurevich-Introduction-and-Some-History A good lecture going deep into Abstract Machines]

[[NP,_NP_Complete,_NP_Hard| P, NP, NPC and NP-Hard in SImple terms]]

[[Identify_the_class_of_the_language|Identify the class of the language]]



[[Category:Automata Theory]]
[[Category: Notes & Ebooks for GATE Preparation]]