CS8501-Theory of Computation
Change Subject
19CS508 - Big Data Analytics (Aug 2023)
19IT503-Internet of Things
19CS503-Cryptography and Network Security
19CS502-Automata Theory and Compiler design (Class A)
Home
Syllabus
Lecture notes
Puzzles
Resourselink
Assignments
Grades & Toppers
Youtube videos
Question Bank
Menu
946
Page views
63
Files
1
Videos
1
R.Links
Lecture Notes
UNIT 1:
Basic Mathematical Definition
Finite Automata
Additional Proofs
Automation
Deterministic Finite Automata
NFA
Non Deterministic Finite Automata
Finite Automata with e transition
UNIT 2:
regular Expression
FA and Regular Expression
Proving Languages not to be regular
Closure Properties
Closure properties of RL
Regular Languages
UNIT 3:
Grammar
Parse tree
Ambiguity in Grammar
Definition of PDA
Languages of a PDA
Languages of a PDA
Equivalence of PDA and CFG
Deterministic PDA
UNIT 4:
CFG
NORMAL FORMS OF CFG
Pumping Lemma
Pumping Lemma for CFG
Closure Properties
Closure Properties of CFL
Turing Machine
Programming Techniques
UNIT 5:
Non Recursive Enumerable Languages
The Class NP
The Class P and NP
Undecidable Problem
Undecidable Problem with RE
Post Correspondence Problem
Undecidable Problem about TM
The Class P
Announcements
Recent Files
30
Sep
Pumping Lemma
30
Sep
Pumping Lemma for CFG
30
Sep
Closure Properties
30
Sep
Closure Properties of CFL
30
Sep
Turing Machine
30
Sep
Programming Techniques
X
SNS COLLEGE OF ENGINEERING
ADMIN DEPARTMENT
erp.snsct.snsce@gmail.com
9944177100
