SkillSage | A Digital Platform For Engineering Video Courses & Lectures

Product Details

Theory of Computation | Sem V | Information Technology| Savitribai Phule Pune University


Cost :     

Delivery Method :
Validity :
Months
Quantity :

Note ! "Exciting rewards for loyal customers. Refer ur friends and earn Cashbacks. For more details call on 9075150035"

Links ! N/A
  • Product Info
  • Description
  • Demo Videos
  • Reviews
  • Index
  • About the Faculty

Product Info

Kit ContentsIndex Sheet, Google Drive Link, Video Lectures Guide, Installation Guide
Lecture Duration15 Hours
Validity Period12 Months
Total Views3
ModeGoogle Drive
Runs OnDesktop & Laptop
System RequirementWindows 7 & above | Ram: 2 GB | Processor: 2.0 GHz and above
Video LanguageEnglish
Study Material LanguageEnglish
Applicable CourseEngineering
Dispatched BySkillSage.in
Dispatch Time48 Hours
Delivery Time3- 5 Days

Description

The SkillSage Kit includes

1. Google Drive Link - which Includes lectures
2. Installation Guide
3. Video Lectures Guide

Demo Videos

Reviews

Rate your learning experience :-

(Reviews can be posted on buying this product)

Write a review-


User Reviews :-

No reviews found..

Index

No.

Chapter Name

No. of Videos

Duration

 

Chapter I: 

 

 

1

Finite State Machines : Basic Concepts: Symbols, Strings, Language, Formal Language, Natural Language. Basic Machine and Finite State Machine. FSM without output: Definition and Construction-DFA, NFA, NFA with epsilon-Moves, Minimization Of FA, Equivalence of NFA and DFA, Conversion of NFA with epsilon moves to NFA, Conversion of NFA With epsilon moves to DFA. FSM with output: Definition and Construction of Moore and Mealy Machines, Inter-conversion between Moore and Mealy Machines.

6

3 Hr 

 

Chapter II:

 

 

1

Regular Expressions : Definition and Identities of Regular Expressions, Construction of Regular Expression of the given L, Construction of Language from the RE, Construction of FA from the given RE using direct method, Conversion of FA to RE using Arden’s Theorem, Pumping Lemma for RL, Closure properties of RLs, Applications of Regular Expressions.

8

3 Hr 

 

Chapter III: 

 

 

1

Context Free Grammars  and Languages : Introduction, Formal Definition of Grammar, Notations, Derivation Process: Leftmost Derivation, Rightmost Derivation, derivation trees, Context Free Languages, Ambiguous CFG, Removal of ambiguity, Simplification of CFG, Normal Forms, Chomsky Hierarchy, Regular grammar, equivalence of RG(LRG and RLG) and FA.

12

2 Hr

 

Chapter IV: 

 

 

1

Push Down Automata: Introduction and Definition of PDA, Construction (Pictorial/ Transition diagram) of PDA, Instantaneous Description and ACCEPTANCE of CFL by empty stack and final state, Deterministic PDA Vs Nondeterministic PDA, Closure properties of CFLs, pumping lemma for CFL. Post Machine- Definition and construction.

5

3 Hr

 

Chapter V: 

 

 

1

Turing machine : Formal definition of a Turing machine, Recursive Languages and Recursively Enumerable Languages, Design of Turing machines, Variants of Turing Machines: Multi-tape Turing machines, Universal Turing Machine, Nondeterministic Turing machines. Comparisons of all automata.

10

2 Hr

 

Chapter VI:

 

 

1

Computational Complexity : Decidability: Decidable problems concerning regular languages, Decidable problems concerning context-free languages, Un-decidability, Halting Problem of TM, A Turing-unrecognizable language. Reducibility: Un-decidable Problems from Language Theory, A Simple Un-decidable Problem PCP, Mapping Reducibility Time Complexity: Measuring Complexity, The Class P, Examples of problems in P, The Class NP, Examples of problems in NP, NP-completeness.

10

2 Hr

 

Total

51

 15 Hr 

About the Faculty

Chandrapal Chauhan has done M. Tech. in Computer Science and Engineering and B. E. in Computer Engineering from VJTI Mumbai. He has 14 Years of experience in teaching and have expertise in Theory of Computation, Analysis of Algorithms, Data Structures, C Programming, Computer Networks, Microprocessor and Microcontroller, Artificial Intelligence.

His interactive and energetic way of teaching is very famous among students. He gives more emphasis on clearing basic conceptual topics and practical application of each concept which is admired by his students. 

Currently he is associated with prestigious engineering institute in Nagpur.

Other Courses by Faculty