Theory of Computation and Automata - Part 1
4.5 (1 rating)
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.
1 student enrolled

Theory of Computation and Automata - Part 1

...Understanding the basics of automation
4.5 (1 rating)
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.
1 student enrolled
Created by Sridhar Iyer
Last updated 12/2019
English
English [Auto-generated]
Current price: $13.99 Original price: $19.99 Discount: 30% off
5 hours left at this price!
30-Day Money-Back Guarantee
This course includes
  • 3 hours on-demand video
  • 1 downloadable resource
  • 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
  • Automata Theory
  • Theory of Computation
  • Finite Automata (FA)
  • FA with output
  • Regular Expressions
  • Finite State Machines
Requirements
  • An open mind full of excitement to learn and grasp new things.
Description

The course will walk you through the basics of Automata Theory, alternatively known as Theory of Computer/Computation Science. Its one of the most important subjects in the curriculum of Computer Science and Information Technology. All the modern day computers are designed on the basis of the simple automation models. We will learn some of those models in this part of the course.

The complete course is divided into 3 parts.:

Part 1: Introduction , Finite Automata and Introduction to Regular Expressions

Part 2 : Grammar and Push Down Automata

Part 3 : Turing Machines and Undecidability Problems


This course will cover the 1st part of the course.  Subsequent parts will be released in the follow up courses.

Who this course is for:
  • Students with an attitude to learn and solve problems
  • Students willing to understand the mathematics behind automation
  • Students who wish to learn Automata Theory and Theory of Computation
Course content
Expand all 17 lectures 03:06:54
+ Basic Definitions
1 lecture 18:25
Understanding the Basic Concepts and Definitions
18:25
+ Finite State Machines
1 lecture 21:26
Introduction to FSM and a basic Problem
21:26
+ Finite State Machines - Divisibility Tester
3 lectures 22:52
Divisibility of a decimal number by 4
05:08
Divisibility of a Binary Number by 4
10:16
Divisibility of a ternary Number by 4
07:28
+ Finite State Machines - String Operations
5 lectures 45:55
FSM to accept inputs ending with 110
10:57
FSM to accept inputs ending with babb
10:17
FSM to accept inputs containing 1011
08:33
FSM to accept inputs containing ODD number of a's
10:47
FSM to accept inputs which doesn't contain 3 consecutive occurrence of b
05:21
+ Binary Adder
1 lecture 15:42
FSM to implement a Binary Adder
15:42
+ Finite Automata
3 lectures 31:57
Introduction to Deterministic Finite Automata (DFA)
11:02
FA with Outputs - Moore Machines
13:34
FA with Outputs - Mealy Machines
07:21