Category:Automata Theory Notes - GATECSE

Video Lectures by Shai Simonson

Regular expressions, questions and solutions

Recursively Enumerable Sets

Recursively Enumerable Sets

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

Pages in category "Automata Theory Notes"

The following 6 pages are in this category, out of 6 total.

C

Closure Property of Language Families

G

Grammar: Decidable and Undecidable Problems

I

Identify the class of the language

N

NP, NP Complete, NP Hard

R

Rice's Theorem with Examples

S

Some Reduction Inferences

Retrieved from "https://gatecse.in/w/index.php?title=Category:Automata_Theory_Notes&oldid=4472"