Category:Automata Theory Notes - Revision history

Starry Starr at 00:30, 7 May 2015

2015-05-07T00:30:05Z

Arjun Suresh at 10:45, 15 October 2014

2014-10-15T10:45:08Z

Arjun Suresh at 09:48, 20 August 2014

2014-08-20T09:48:15Z

Arjun Suresh at 09:39, 14 July 2014

2014-07-14T09:39:56Z

Arjun Suresh at 09:37, 14 July 2014

2014-07-14T09:37:59Z

Arjun Suresh at 09:34, 14 July 2014

2014-07-14T09:34:08Z

Arjun Suresh: Created page with "Category:Automata Theory"

2014-07-14T09:32:31Z

Created page with "Category:Automata Theory"

New page

[[Category:Automata Theory]]

← Older revision		Revision as of 00:30, 7 May 2015
Line 44:		Line 44:


−	[[Category:~~Automata~~ Theory]]	+	[[Category:Theory of Computation]]
	[[Category: Notes & Ebooks for GATE Preparation]]		[[Category: Notes & Ebooks for GATE Preparation]]

@@ 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://csfundas.wordpress.com/theory-of-computation-2/recursively-enumerable Recursively Enumerable Sets]

← Older revision		Revision as of 09:48, 20 August 2014
Line 18:		Line 18:

	[http://www.cs.cornell.edu/Courses/cs4820/2013sp/Handouts/481TM.pdf Turing Machine Handout]		[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]		[http://theory.stanford.edu/~trevisan/cs154-12/rice.pdf Rice's theorem, Undecidable and unrecognizable problems on TM]

@@ Line 33: / Line 33: @@
 [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|Identify the class of the language]]
+[[NP,_NP_Complete,_NP_Hard| P, NP, NPC and NP-Hard in SImple terms]]
 [[Category:Automata Theory]]
 [[Category: Notes & Ebooks for GATE Preparation]]

← Older revision		Revision as of 09:37, 14 July 2014
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://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\|Identify the class of the language]]
		+
		+	{{:NP,_NP_Complete,_NP_Hard}}
		+
	[[Category:Automata Theory]]		[[Category:Automata Theory]]
	[[Category: Notes & Ebooks for GATE Preparation]]		[[Category: Notes & Ebooks for GATE Preparation]]

← Older revision		Revision as of 09:34, 14 July 2014
Line 1:		Line 1:
	[[Category:Automata Theory]]		[[Category:Automata Theory]]
		+	[[Category: Notes & Ebooks for GATE Preparation]]