Theory of Computation : Become a master of DFA

Name: Theory of Computation : Become a master of DFA
Rating: 4.5 (332 reviews)

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

Created byVignesh Sekar

Last updated 2/2023

English

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

Course content

13 sections • 69 lectures • 7h 43m total length

Important : Introduction to Theory of Computation7:53
Set of all Strings possible over an Alphabet9:23
Empty String vs Empty Set vs Empty Language3:26
Differentiate empty string, empty set, and empty language in formal languages. Understand that for an alphabet, an empty language contains no strings, and the empty string is a zero-length string.
Number of strings possible over an alphabet of length n6:14

DFA based on start symbol4:30
Design a minimal dfa that accepts strings starting with a chosen symbol, rejects epsilon, and uses correct initial, final states and complete transitions to cover all inputs.
DFA based on substring6:58
DFA based on start symbols4:26
DFA based on end symbol9:46
DFA based on end symbols11:06
DFA based on end symbols7:37
DFA based on end symbols4:28
DFA based on substring4:21
DFA based on substring5:56
DFA based on start symbol and end symbol10:36
DFA based on start symbol and end symbol4:41
DFA based on start and end symbol6:23
DFA which accepts strings which starts and ends with different symbols10:31
DFA which accepts strings which starts and ends with the same symbol11:26

Complementation of a language8:27
Example 1 on Complementation of a language3:36
Explore whether languages ending with a or b are complements or equal, and define the complement as strings not in the language.
Example 2 on complementation of a language6:22
DFA based on following symbol6:16
Complementation of a DFA6:33
Constructing DFA through complementation technique7:06
Explore constructing a DFA for the language of binary strings that do not start with 0, and derive it via complementation by flipping final and non-final states.
DFA based on following symbol15:11
DFA based on substring5:49
DFA based on following symbol4:12
DFA based on following symbol5:30

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.

Who this course is for:

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

Theory of Computation : Become a master of DFA

What you'll learn

Explore related topics

Course content

Introduction4 lectures • 27min

Introduction to Deterministic Finite Automata (DFA)4 lectures • 39min

DFA based on length of string5 lectures • 23min

DFA based on modulo operator3 lectures • 17min

DFA based on number of instances of a symbol in a string3 lectures • 23min

DFA based on number of instances of a symbol modulo n2 lectures • 14min

DFA based on cartesian product2 lectures • 25min

DFA based on Interpretation of a string as a binary number3 lectures • 34min

DFA based on start symbol, end symbol and substring14 lectures • 1hr 43min

Complementation10 lectures • 1hr 9min

Requirements

Description

Who this course is for: