Theory Of Computation : Become A Master Of Dfa

Master Deterministic Finite Automata of Theory of Computation as Theory of Computation forms core of computer science

What you'll learn
You will become a master of Determinisitic Finite Automata
You will understand the basics of Theory of Computation indepth
You will master Finite Automata of Theory of Computation
You will view Computer Science in a different dimension
You will be able to answer all questions of exams like GATE,PGEE,ISRO on DFA
Understand Why we study theory of computation
You will get ready to learn advanced concepts of theory of computation like Push Down Automata
You will get a very good understanding the basics of computer science
Requirements
Have a PC with internet connection
Even ZERO knowledge in Theory of Computation is fine - I'll teach you everything you need to know about DFA
Description
Welcome to the course Theory of Computation from Scratch !!! Mastering the concepts of Theory of Computation is very important to get started with Computer Science because Theory of Computation is the subject using which one can know whether a problem is solvable or not. The concepts which we are going to study is going to give a very good understanding of Deterministic Finite Automata, which is one of the popular machine and learning it will give a very good foundation to learn advanced concepts of automata like Push Down Automata, Turing Machine.In this course ,every model of Deterministic Finite Automata is taught in an easy-to-understand manner such that anybody without any prerequisites will be able to master the concepts of Deterministic Finite Automata in the easiest way.Come and join me, I assure you that you will have the best learning experience of not just Finite Automata but also the core of Computer Science in a different dimension.

Overview

Section 1: Introduction

Lecture 1 Introduction to Theory of Computation

Lecture 2 Set of all Strings possible over an Alphabet

Lecture 3 Empty String vs Empty Set vs Empty Language

Lecture 4 Number of strings possible over an alphabet of length n

Section 2: Introduction to Deterministic Finite Automata (DFA)

Lecture 5 DFA Explained with Example

Lecture 6 Renaming of states to make it more logical

Lecture 7 DFA vs Minimal DFA

Lecture 8 Representation of a DFA

Section 3: DFA based on length of string

Lecture 9 Minimal DFA that accepts strings of length greater than 2

Lecture 10 Minimal DFA that accepts strings of length less than 3

Lecture 11 DFA that accepts strings of length n

Lecture 12 DFA that accepts strings of length atleast n

Lecture 13 DFA that accepts strings of length atmost n

Section 4: DFA based on modulo operator

Lecture 14 DFA that accepts strings of even length

Lecture 15 How changing final states can change the language

Lecture 16 DFA based on length of string modulo 4

Section 5: DFA based on number of instances of a symbol in a string

Lecture 17 DFA based on number of a's in a string

Lecture 18 Important points to note

Lecture 19 How to change the DFA depending on language modification

Section 6: DFA based on number of instances of a symbol modulo n

Lecture 20 DFA based on number of a's modulo 3

Lecture 21 DFA based on number of a's modulo 5

Section 7: DFA based on cartesian product

Lecture 22 DFA 1 on cartesian product

Lecture 23 DFA 2 on cartesian product

Section 8: DFA based on Interpretation of a string as a binary number

Lecture 24 DFA based on accepting binary strings which are divisible by 2

Lecture 25 DFA based on accepting binary strings which are divisible by 4

Lecture 26 DFA based on accepting binary strings which are divisible by 5

Section 9: DFA based on start symbol, end symbol and substring

Lecture 27 DFA based on start symbol

Lecture 28 DFA based on substring

Lecture 29 DFA based on start symbols

Lecture 30 DFA based on end symbol

Lecture 31 DFA based on end symbols

Lecture 32 DFA based on end symbols

Lecture 33 DFA based on end symbols

Lecture 34 DFA based on substring

Lecture 35 DFA based on substring

Lecture 36 DFA based on start symbol and end symbol

Lecture 37 DFA based on start symbol and end symbol

Lecture 38 DFA based on start and end symbol

Lecture 39 DFA which accepts strings which starts and ends with different symbols

Lecture 40 DFA which accepts strings which starts and ends with the same symbol

Section 10: Complementation

Lecture 41 Complementation of a language

Lecture 42 Example 1 on Complementation of a language

Lecture 43 Example 2 on complementation of a language

Lecture 44 DFA based on following symbol

Lecture 45 Complementation of a DFA

Lecture 46 Constructing DFA through complementation technique

Lecture 47 DFA based on following symbol

Lecture 48 DFA based on substring

Lecture 49 DFA based on following symbol

Lecture 50 DFA based on following symbol

Section 11: Advanced DFA's

Lecture 51 Problem 1

Lecture 52 Problem 2

Lecture 53 Problem 3

Lecture 54 Problem 4

Lecture 55 Problem 5

Lecture 56 Problem 6

Lecture 57 Problem 7

Lecture 58 Problem 8

Lecture 59 Problem 9

Lecture 60 Problem 10

Lecture 61 Problem 11

Section 12: Operations between languages

Lecture 62 Union between languages

Lecture 63 Problem on Union Operation

Lecture 64 Problem on Union Operation

Lecture 65 Concatenation between languages

Lecture 66 Problem on Concatenation Operation

Lecture 67 Reversal of a language

Lecture 68 Problem

Section 13: Bonus : How to proceed further

Lecture 69 Bonus : How to proceed further

Anybody who needs to learn Theory of Computation from scratch,Anybody who wants to pursue a career in Computer Science,Anybody who has Theory of Computation in the Bachelor's degree,Anybody who is preparing for interview in product based companies,If you are preparing for exams like GATE , PGEE , BITS HD , ISRO ,..etc,If you are a Computer Science Engineer