Theory of Computation

Theory of computation provides the basis for creating “correct models” of computational tools: software, digital circuits, concurrent systems etc. it is the branch that aims to attempt the deep understanding of computational processes by means of effectively solving the problems via mathematical models, tools, and techniques.

199 / 999

About Theory of Computation

Theory of computation gives the basis for developing "appropriate versions" of computational tools: software, electronic circuits, simultaneous units and so on it is actually the branch that aims to try deep blue sea understanding of computational methods through effectively addressing the issues using mathematical designs, resources, and approaches.

Learn through Expert faculties

Go at your own pace

User Friendly interface


Chapter 1

1. Regular Language

1.1 Introduction of TOC

1.2 Chomsky Classification of Grammar

1.3 Regular Grammar, Regular Expression

1.4 Finite State Automata

1.5 Minimization of DFA

1.6 GATE Questions

1.7 Convertions Between FSA-RE-RG

1.8 Is Language Regular or Not

1.9 NFA-e to DFA Convertion

1.10 GATE Questions

1.11 Properties of Regular Language

1.12 GATE Questions

1.13 Mealy Moore Machine

13 videos

Grammar Chomsky Classification of Grammar Type 0 Grammar Type 1 Grammar Type 2 Grammar Type 3 Grammar Relation Between Chomsky Classification of Grammar

Regular Grammar Regular Expression Regular Expression Identities GATE Questions

FSA NFA & DFA NFA to DFA Convertion

Finite State Automata to Regular Expression 1. Arden's Theorm 2. State Elimination Method Finite State Automata to Regular Grammar Finite State Automata to Left Linear Grammar Regular Grammar to FSA

Is Language Regular or Not

NFA-ε to DFA Convertion

Closure & Non-Closure properties Pumping Lemma

Mealy Machine Moore Machine Moore Machine to Mealy Machine Mealy Machine to Moore Machine

Chapter 2

2. Context Free Grammar

2.1 Context Free Grammar

2.2 Simplification of CFG

2.3 Normal Form

2.4 CYK Algorithm

2.5 GATE Questions

5 videos

CFG Left Most Derivation Right Most Derivation Ambiguous Grammar Inherently Ambiguous Grammar

Simplification of CFG

CNF (Chomsky Normal Form) GNF (Greibach Normal Form) CFG to CNF CFG to GNF Remove Left Recursion

Chapter 3

3. CFL & PDA

3.1 CFL to PDA


3.3 CFL or Not

3.4 CFG to PDA

3.5 Closure Properties of CFL

3.6 GATE Questions

6 videos

Closure Properties Summary Pumping Lemma

Chapter 4

4. Turing Machine

4.1 Unresticted Grammar (Type-0)

4.2 Turing Machine

4.3 Turing Machine as a Transducer

4.4 Types of Turing Machine

4.5 RL, REL & Closure Properties

4.6 GATE Questions

6 videos

Unresticted Grammar (Type-0)

Turing Machine as a Transducer

Types of Turing Machine

Unrestricted Language Closure Properties of RL & REL

Chapter 5

5.1 Decidability & Countability

5.1 Decidability & Countability

1 videos

Decidability Countability Points to Remember GATE Questions

Chapter 6

Finite Automata and Regular Expression

1.1 Alphabets, Strings and Languages

1.2 Operations on Languages

1.3 Automata and Grammars

1.4 Finite Automata

1.5 Minimization of Deterministic Finite Automata (DFA) 

1.6 Regular Expression: Formal Definition 

1.7 Language Described by RES  

1.8 Regular Expression & Regular Language 

1.9 Regular Grammars 

1.10 Regular Language 

1.11 Non-Regular Languages 

1.12 Power of DFA and NFA in terms of Language Acceptance 

1.13 Things to Remember 

1.14 Gate Questions 

Will be available from: 31st July 2019

Chapter 7

Context-free Grammars and Pushdown Automata

2.1 Context Free Grammar (CFG)

2.2 Derivation, Parse Tree and Ambiguity

2.3 Left Recursion, Left Factoring and Normal Forms

2.4 Pushdown Automata (PDA) 

2.5 Deterministic and Non-Deterministic PDA 

2.6 Equivalence of PDAS and CFGS 61 2.7 Context Free Languages

2.8 Closure Properties of CFL

2.9 Things to Remember

2.10 Gate Questions 

Will be available from: 31st July 2019

Chapter 8

Turing Machine, Unrestricted Languages, Complexity

3.1 Informal Description

3.2 Types of Turing Machine

3.3 Recursive and Recursively Enumerable Languages

3.4 Unrestricted Grammars 

3.5 Context Sensitive Grammar and Linear Bounded Automata

3.6 Chomsky Hierarchy  

3.7 Complexity Theory 

3.8 P, NP, NP-Hard and NP-Complete Problems

3.9 Gate Questions 

Will be available from: 31st July 2019

Live Lectures



This Week

This Month


Doubt Sessions



This Week

This Month





Load More



No faqs found