Open App

Index

Introduction to Grammars, Languages & Automata

Regular Expressions, Languages, Grammar & Finite Automata

Context Free Grammar, Languages and Pushdown Automata

Regular & Context Free Languages, Pumping Lemma

Turing Machines

Undecidability

Revision Notes

Previous Year Questions - (Theory of Computation)

All Exams > Computer Science Engineering (CSE) > Theory of Computation > All Notes

All notes of Theory of Computation for Computer Science Engineering (CSE) Exam

Introduction to Grammars, Languages & Automata

PPT: Introduction & Automata

25 pages

Introduction: Theory of Computation

2 pages

Formal Representation of Languages & Chomsky Hierarchy

7 pages

Recursive Function Theory

10 pages

Relationship Between Grammar & Language in TOC

2 pages

Applications of Automata

1 page

Proving Techniques

5 pages

Computable & Non-Computable Functions

2 pages

Mind Map: Introduction to Grammars, Languages & Automata

1 page

Formula Sheets: Introduction to Grammars, Languages & Automata

2 pages

Handwritten notes: Introduction to Grammars, Languages & Automata

13 pages

Flashcards: Introduction to Grammars, Languages & Automata

20 cards

Join for Free

Regular Expressions, Languages, Grammar & Finite Automata

Regular Expressions & Finite Automata

22 pages

Intersection Process of Two DFAs

1 page

Short Notes: Regular Expressions & Finite Automata

5 pages

Regular Expressions

7 pages

Finite Automata

6 pages

Introduction to Automata Theory

1 page

NFA to DFA Conversion

6 pages

Minimization of DFA

2 pages

Automata with Output

4 pages

Applications of Finite Automata

1 page

Pumping Lemma for Regular Languages

7 pages

PPT: Introduction to Automata Theory

25 pages

PPT: Finite Automata

41 pages

PPT: Regular Expressions

16 pages

Regular Expression to Epsilon NFA

1 page

Regular Expression to DFA

6 pages

NFA to Regular Expression

2 pages

Arden's Lemma

2 pages

Formula Sheets: Regular Expressions, Languages, Grammar & Finite Automata

3 pages

Handwritten notes: Regular Expressions, Languages, Grammar & Finite Automata- 1

66 pages

Handwritten notes: Regular Expressions, Languages, Grammar & Finite Automata- 2

2 pages

Mind Map: Regular Expressions, Languages, Grammar & Finite Automata

1 page

Flashcards: Regular Expressions, Languages, Grammar & Finite Automata

20 cards

Context Free Grammar, Languages and Pushdown Automata

PPT: Pushdown Automata (PDA)

37 pages

Context Free Grammars (CFG)

7 pages

Context-Sensitive Grammar (CSG) & Language (CSL)

1 page

Check if the language is Context Free or Not

3 pages

Simplification of Context Free Grammars

8 pages

Normal Forms for CFGs

7 pages

Pushdown Automata (PDA)

21 pages

Pumping Lemma for Context Free Languages (CFLs)

4 pages

PPT: Properties of Context-Free Languages

62 pages

PPT: Context-Free Languages & Grammars

40 pages

Closure Properties of Context Free Languages

3 pages

Relationship Between Grammar & Language

1 page

Equivalence of Pushdown Automata with Context-Free Grammar

45 pages

Formula Sheets: Context Free Grammar, Languages and Push Down Automata

2 pages

Handwritten notes: Context Free Grammar, Languages and Push Down Automata

28 pages

Mind Map: Context Free Grammar, Languages and Pushdown Automata

1 page

Flashcards: Context Free Grammar, Languages and Push Down Automata

20 cards

Theory of Computation

18 videos|93 docs|44 tests

Join course for free

Join course for free

Regular & Context Free Languages, Pumping Lemma

Context-Sensitive Grammar (CSG) & Language (CSL)

1 page

Check if the language is Context Free or Not

3 pages

Short Notes: Regular and Context Free Languages

2 pages

Pumping Lemma for Regular Languages

7 pages

Short Notes: Pumping Lemma

2 pages

Pumping Lemma for Context Free Languages (CFLs)

4 pages

Closure Properties of Context Free Languages

3 pages

Relationship Between Grammar & Language

1 page

DFA to Regular Expression

3 pages

Formula Sheets: Regular & Context Free Languages, Pumping Lemma

2 pages

Handwritten notes: Regular & Context Free Languages, Pumping Lemma

2 pages

Mind Map: Regular & Context Free Languages, Pumping Lemma

1 page

Flashcards: Regular & Context Free Languages, Pumping Lemma

20 cards

Turing Machines

Turing Machine (TM)

7 pages

Short Notes: Turing Machine

5 pages

Designing of Turing Machines

12 pages

TM as Transducers

5 pages

Types of TM: Turing Machines

4 pages

Church’s Thesis, Godelization, Time Complexity of Turing Machine & Halting Problem of TM

6 pages

Rice Theorem

1 page

Post Correspondence Problem & Linear Bounded Automata

4 pages

PPT: Turing Machines

27 pages

Turing Recognizable & Turing Decidable

1 page

Halting Problem

3 pages

Determining Accountability

2 pages

Formula Sheets: Turing Machines

2 pages

Handwritten notes: Turing Machines

15 pages

Mind Map: Turing Machines

1 page

Flashcards: Turing Machines

20 cards

Undecidability

Short Notes: Undecidability

3 pages

Complexity, Complexity Class P & Complexity Class NP

10 pages

Vertex Cover Problem

2 pages

Clique Problem

2 pages

Hamiltonian Cycle Problem

1 page

SAT (Boolean Formula Satisfiability Problem)

5 pages

Travelling Salesman Problem (TSP)

2 pages

Formula Sheets: Undecidability

2 pages

Handwritten notes: Undecidability

4 pages

Mind Map: Undecidability

1 page

Flashcards: Undecidability

20 cards

Revision Notes

Regular Expressions & Finite Automata

22 pages

Context-free Grammars & Push-Down Automata

11 pages

Pumping lemma

2 pages

Turing Machines & Undecidability

13 pages

Previous Year Questions - (Theory of Computation)

Previous Year Questions: Regular Expression

6 pages

Previous Year Questions: Regular Grammar

3 pages

Previous Year Questions: Regular Language

16 pages

Previous Year Questions: Finite Automata

19 pages

Previous Year Questions: Context Free Grammar

9 pages

Previous Year Questions: Context Free Language

19 pages

Previous Year Questions: Push-down Automata

4 pages

Previous Year Questions: Recursive Language

4 pages

Previous Year Questions: Turing Machine

12 pages

Previous Year Questions: Undecidability

5 pages

Theory of Computation

18 videos|93 docs|44 tests

Top Courses Computer Science Engineering (CSE)

Explore Courses

Revision notes for Theory of Computation 2025 is part of Computer Science Engineering (CSE) exam preparation. The notes have been prepared according to the Computer Science Engineering (CSE) exam syllabus. The revision notes, tests & MCQs are made for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests here.

Notes of Theory of Computation in English & Hindi are available as part of Computer Science Engineering (CSE) exam. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

© EduRev

Education Revolution

Signup on EduRev and stay on top of your study goals

Signup with Google

10M+ students crushing their study goals daily