Stuff Sector
Prepared by
S.Santhosh (Admin)
Important questions
share it a link alone
Don't waste my hardwork and valuable time
Don't share as screenshot kind request
based on views next exams questions are yet to be updated
most viewed dept will get update at first So Dont screenshot and share
most viewed dept will get update at first So Dont screenshot and share
CS8501 Theory of computation (TOC)
unit 1 - Deterministic Finite Automata
- Non-deterministic Finite Automata (NFA)
- Finite Automata with Epsilon Transitions
UNit 2 - Equivalence and Minimization of Automata.
- Closure Properties of Regular Languages
- FA and Regular Expressions
UNIT 3 - Equivalence of Pushdown Automata and CFG
- Deterministic Pushdown Automata.
- Parse Trees
UNIT 4Pumping Lemma for CFL Closure Properties of CFLTuring Machines*** related problems toounit 5 Universal lang ( Recursive and recursively enumerable languages) P and NP completeness rrare
Don't share as screenshot -Stuff sector
**Very important questions are bolded and may be asked based on this topic
PART-C
1.Compulsory Questions {a case study where the student will have to read and analyse the subject }mostly asked from unit 2, 5(OR) a situation given and you have to answer on your own
CS8501 Theory of computation (TOC)
unit 1
- Deterministic Finite Automata
- Non-deterministic Finite Automata (NFA)
- Finite Automata with Epsilon Transitions
UNit 2
- Equivalence and Minimization of Automata.
- Closure Properties of Regular Languages
- FA and Regular Expressions
UNIT 3
- Equivalence of Pushdown Automata and CFG
- Deterministic Pushdown Automata.
- Parse Trees
UNIT 4
Pumping Lemma for CFL
Closure Properties of CFL
Turing Machines*** related problems too
unit 5
Universal lang ( Recursive and recursively enumerable languages)
P and NP completeness rrare
Don't share as screenshot -Stuff sector
**Very important questions are bolded and may be asked based on this topic
PART-C
1.Compulsory Questions {a case study where the student will have to read and analyse the subject }
mostly asked from unit 2, 5(OR) a situation given and you have to answer on your own
don't waste my hardwork and valuable time
As Engineer i think you know how to respect another
Share it as link alone . don't share it as screenshot or any text material if u found this anywhere kindly report me . #Admin WhatsAppContact uS for more updates
*These questions are expected for the exams This may or may not be asked for exams All the best.... from admin Santhosh
Thanks for your love and support guys keep supporting and share let the Engineers know about Us and leave a comment below for better improvements If there is any doubt feel free to ask me I will clear if I can or-else I will say some solutions ..get me through WhatsApp for instant updates ~$tuff$£ctorSYllabuS
UNIT I AUTOMATA FUNDAMENTALS
Introduction to formal proof — Additional forms of Proof — Inductive Proofs –Finite Automata — Deterministic Finite Automata — Non-deterministic Finite Automata — Finite Automata with Epsilon Transitions
UNIT II REGULAR EXPRESSIONS AND LANGUAGES
Regular Expressions — FA and Regular Expressions — Proving Languages not to be regular — Closure Properties of Regular Languages — Equivalence and Minimization of Automata.
UNIT III CONTEXT FREE GRAMMAR AND LANGUAGES
CFG — Parse Trees — Ambiguity in Grammars and Languages — Definition of the Pushdown Automata — Languages of a Pushdown Automata — Equivalence of Pushdown Automata and CFG, Deterministic Pushdown Automata.
UNIT IV PROPERTIES OF CONTEXT FREE LANGUAGES
Normal Forms for CFG — Pumping Lemma for CFL — Closure Properties of CFL — Turing Machines — Programming Techniques for TM.
UNIT V UNDECIDABILITY
Non Recursive Enumerable (RE) Language — Undecidable Problem with RE — Undecidable Problems about TM — Post?s Correspondence Problem, The Class P and NP.
Contact uS for more updates
*These questions are expected for the exams This may or may not be asked for exams
All the best.... from admin Santhosh
Thanks for your love and support guys keep supporting and share let the Engineers know about Us and leave a comment below for better improvements
If there is any doubt feel free to ask me I will clear if I can or-else I will say some solutions ..get me through WhatsApp for instant updates ~$tuff$£ctorIntroduction to formal proof — Additional forms of Proof — Inductive Proofs –Finite Automata — Deterministic Finite Automata — Non-deterministic Finite Automata — Finite Automata with Epsilon Transitions
UNIT II REGULAR EXPRESSIONS AND LANGUAGES
Regular Expressions — FA and Regular Expressions — Proving Languages not to be regular — Closure Properties of Regular Languages — Equivalence and Minimization of Automata.
UNIT III CONTEXT FREE GRAMMAR AND LANGUAGES
CFG — Parse Trees — Ambiguity in Grammars and Languages — Definition of the Pushdown Automata — Languages of a Pushdown Automata — Equivalence of Pushdown Automata and CFG, Deterministic Pushdown Automata.
UNIT IV PROPERTIES OF CONTEXT FREE LANGUAGES
Normal Forms for CFG — Pumping Lemma for CFL — Closure Properties of CFL — Turing Machines — Programming Techniques for TM.
UNIT V UNDECIDABILITY
Non Recursive Enumerable (RE) Language — Undecidable Problem with RE — Undecidable Problems about TM — Post?s Correspondence Problem, The Class P and NP.