SkillSage | A Digital Platform For Engineering Video Courses & Lectures

Product Details

Theory of Computation | Sem V | Information Technology |Dr. Babasaheb Ambedkar Technological University

Cost :     

Delivery Method :
Validity :
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
Dispatch Time48 Hours
Delivery Time3- 5 Days


The SkillSage Kit includes

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

Demo Videos


Rate your learning experience :-

(Reviews can be posted on buying this product)

Write a review-

User Reviews :-

No reviews found..



Chapter Name

No. of Videos



Chapter I: 




Finite Automata and Regular Expressions: Definition of deterministic finite automata, Non-deterministic finite automata, Moore and Mealy machines and their conversions, Regular expressions, Recursive definition, NFA with e-moves, Inter-conversion between NFA and DFA, Regular expression and FA, Pumping lemma.


3 Hr 


Chapter II:




Context Free Grammars: Definition, Production rules, Ambiguous grammar, Removal of ambiguity, Chomsky hierarchy, Context Free Grammar (CFG) – definition, Simplification of CFG


3 Hr 


Chapter III: 




Context Free Languages: Definition of context free languages, Regular grammar definition, Left linear, Right linear grammar, Interconversion between left linear and right linear regular grammar, Regular grammar and finite automata, CNF, GNF, Derivation graphs, Type 0 and Type 1 grammars..


2 Hr


Chapter IV: 




Pushdown Automata: Formal definition, Pushdown automata (PDA), Deterministic Pushdown automata (DPDA) – definition, Non-deterministic Pushdown automata (NPDA)-definition, relative powers of DPDA and NPDA.


3 Hr


Chapter V: 




Turing Machines: The definition of a Turing machine, Computing with Turing machine, Extensions of Turing machines, Random access Turing machines, Non-deterministic Turing machines, Grammars, The Church’s Turing hypothesis, Universal Turing machines, The Halting problem, Unsolvable problems about Turing machines


2 Hr


Chapter VI:




Applications: Applications of RE and FA – Lexical analyzer, Text editor and searching using RE, Applications of PDA – Expression conversion, Applications of CFG – syntax analysis, Language definition


2 Hr




 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