Difference between revisions of "Category:Automata Theory Notes"

@@ Line 1: / Line 1: @@
 [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://www.idt.mdh.se/kurser/cd5560/10_01/examination/KOMPENDIER/Regular/kompendium_eng.pdf Regular expressions, questions and solutions]
 [http://csfundas.wordpress.com/theory-of-computation-2/recursively-enumerable Recursively Enumerable Sets]
@@ Line 18: / Line 21: @@
 [http://www.cs.cornell.edu/Courses/cs4820/2013sp/Handouts/481TM.pdf Turing Machine Handout]
+[http://www.cs.toronto.edu/~sacook/csc463h/notes/comp.pdf Reduction examples for decidablility]
 [http://theory.stanford.edu/~trevisan/cs154-12/rice.pdf Rice's theorem, Undecidable and unrecognizable problems on TM]
@@ Line 39: / Line 44: @@
-[[Category:Automata Theory]]
+[[Category:Theory of Computation]]
 [[Category: Notes & Ebooks for GATE Preparation]]