Arjun Suresh (talk | contribs) |
Starry Starr (talk | contribs) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
| + | |||
[http://www.youtube.com/playlist?list=PL601FC994BDD963E4 Video Lectures by Shai Simonson] | [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.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] | [http://csfundas.wordpress.com/theory-of-computation-2/recursively-enumerable Recursively Enumerable Sets] | ||
| Line 41: | Line 44: | ||
| − | [[Category: | + | [[Category:Theory of Computation]] |
[[Category: Notes & Ebooks for GATE Preparation]] | [[Category: Notes & Ebooks for GATE Preparation]] | ||
Video Lectures by Shai Simonson
Regular expressions, questions and solutions
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)
A good lecture going deep into Abstract Machines
P, NP, NPC and NP-Hard in SImple terms
Identify the class of the language
The following 6 pages are in this category, out of 6 total.
GATECSE