Theory of Computation (TOC)
2.9 (6 ratings)
Course Ratings are calculated from individual students’ ratings and a variety of other signals, like age of rating and reliability, to ensure that they reflect course quality fairly and accurately.
2,923 students enrolled

Theory of Computation (TOC)

various models of computation and study their power and limitations.
2.9 (6 ratings)
Course Ratings are calculated from individual students’ ratings and a variety of other signals, like age of rating and reliability, to ensure that they reflect course quality fairly and accurately.
2,923 students enrolled
Created by Edutainer India
Last updated 12/2019
English
Current price: $55.99 Original price: $79.99 Discount: 30% off
5 hours left at this price!
30-Day Money-Back Guarantee
This course includes
  • 5 hours on-demand video
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
Training 5 or more people?

Get your team access to 4,000+ top Udemy courses anytime, anywhere.

Try Udemy for Business
What you'll learn
  • One can master Finite Automata of Theory of Computation
  • In-depth understanding of the basics of Theory of Computation concepts
  • Understanding the need of study of theory of computation
  • Understanding the advanced concepts of theory of computation like Push Down Automata
  • One will be able to answer all questions of important exams like GATE, PGEE, ISRO, DFA, BITS HD, etc.
  • Better understanding of the basic concepts of Computer Science
Requirements
  • No there is no as such requirement for learning the course proceedings.
Description

Course Information:

This is an introductory course on the theory of computation intended for undergraduate students in computer science. In this course, we will introduce various models of computation and study their power and limitations. We will also explore the properties of corresponding language classes defined by these models and the relations between them. It is designed based on the syllabus given by GATE Computer Science exam.

Why Enroll:

Theory of computation is mainly concerned with the study of how problems can be solved using algorithms. These studies are used to understand the way an algorithm is meant to work and to actually prove it work through analyzing problems that may arise with the technique used and finding solutions to these problems. This course will help you to solve the problems which are asked in GATE exam.

Career Prospects:

Learning this course will help you to make a career in different fields and positions such as

  1. Lecturer (Computer Science)

  2. Research Engineer

  3. Software Engineer

Course Detail:

The Course contains a formal connection between algorithmic problem solving and the theory of languages, automata. It also develops them into a mathematical (and less magical) view towards the algorithmic design and in general computation itself. The course should, in addition, clarify the practical view towards the applications of these ideas in the engineering part of CS. This course will cover the language such as Regular Language, Context Free Language, Context Sensitive Language, and Recursively Enumerable sets. It also covers their corresponding grammar and machine.



Who this course is for:
  • Anyone who is interested in learning theory of computation and its concepts.
Course content
Expand all 40 lectures 04:53:06
+ Deterministic Finita Automata(DFA)
10 lectures 01:12:42
Deterministic Finite Automata(DFA)
10:37
Example of DFA
11:38
DFA Example2
06:54
DFA Example 3
05:41
DFA Example 4
05:24
Operations on DFA
04:59
Concatenation Operation
05:48
Cross Product Operation
09:06
Compelementation Operation
04:45
Reversal Operation
07:50
+ Non-Deterministic Finite Automata (NDFA)
6 lectures 51:33
Introduction of Non-Deterministic Finite Automata (NDFA)
11:20
Examples Of NDFA
09:22
Conversion of NDFA To DFA
08:35
Example of NDFA Conversion
06:27
Example of NDFA Conversion
10:03
Complementation of NDFA
05:46
+ Epsilon NDFA
3 lectures 28:51
Introduction of Epsilon Ndfa
08:36
Conversion of Epsilon NDFA to NDFA
10:02
Example of Epsilon NDFA Conversion
10:13
+ Minimization of DFA
3 lectures 25:45
Introduction To Minimization of DFA
04:17
Example of Minimization(DFA)
11:43
Example of Minimization(DFA)
09:45
+ Moore & Mealy Machine
6 lectures 45:57
Introduction of Moore And Mealy Machine
11:35
Example of Moore Machine
05:11
Example of Moore Machine2
05:54
Example of Mealy Machine
04:02
Conversion of Moore To Mealy Machine
09:37
Conversion of Mealy To Moore Machine
09:38
+ Families of Languages
2 lectures 13:38
Introduction To Families of Languages
07:02
Families of Languages
06:36
+ Regular Expression
7 lectures 35:47
Introduction of Regular Expression
03:26
Basic Operations on Regular Expression
06:53
Example of Regular Expression1
04:37
Example of Regular Expression2
04:46
Example Of Regular Expression3
06:40
Identities of Regular Expression
04:01
Conversion of Regular Expression To Finite Automata
05:24