# 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.

#### ₹ 149 / ₹ 999

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

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

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

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

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.2 NPDA & DPDA

3.3 CFL or Not

3.4 CFG to PDA

3.5 Closure Properties of CFL

3.6 GATE Questions

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

Chapter 5

### 5. Decidability & Countability

5.1 Decidability & Countability

1 videos

Decidability Countability Points to Remember GATE Questions

This Week

This Month

Later

This Week

This Month

Later

### FAQ's

The validity for These videos will be till 30th April 2020 irrespective of date of Buying. You may listen to the videos n number of Times with a good internet connection anytime anywhere.