Theory of Computation : Become a master of DFA

Focused View

Vignesh Sekar

7:42:59

253 View

1 - Introduction

1 - Introduction to Theory of Computation.mp4

07:53

2 - Set of all Strings possible over an Alphabet.mp4

09:23

3 - Empty String vs Empty Set vs Empty Language.mp4

03:26

4 - Number of strings possible over an alphabet of length n.mp4

06:14

2 - Introduction to Deterministic Finite Automata DFA

5 - DFA Explained with Example.mp4

21:25

6 - Renaming of states to make it more logical.mp4

03:55

7 - DFA vs Minimal DFA.mp4

04:05

8 - Representation of a DFA.mp4

09:41

3 - DFA based on length of string

9 - Minimal DFA that accepts strings of length greater than 2.mp4

06:20

10 - Minimal DFA that accepts strings of length less than 3.mp4

05:27

11 - DFA that accepts strings of length n.mp4

05:25

12 - DFA that accepts strings of length atleast n.mp4

03:11

13 - DFA that accepts strings of length atmost n.mp4

02:27

4 - DFA based on modulo operator

14 - DFA that accepts strings of even length.mp4

07:21

15 - How changing final states can change the language.mp4

03:30

16 - DFA based on length of string modulo 4.mp4

06:34

5 - DFA based on number of instances of a symbol in a string

17 - DFA based on number of as in a string.mp4

06:51

18 - Important points to note.mp4

06:41

19 - How to change the DFA depending on language modification.mp4

09:21

6 - DFA based on number of instances of a symbol modulo n

20 - DFA based on number of as modulo 3.mp4

05:55

21 - DFA based on number of as modulo 5.mp4

08:22

7 - DFA based on cartesian product

22 - DFA 1 on cartesian product.mp4

16:51

23 - DFA 2 on cartesian product.mp4

07:44

8 - DFA based on Interpretation of a string as a binary number

24 - DFA based on accepting binary strings which are divisible by 2.mp4

16:56

25 - DFA based on accepting binary strings which are divisible by 4.mp4

08:52

26 - DFA based on accepting binary strings which are divisible by 5.mp4

08:11

9 - DFA based on start symbol end symbol and substring

27 - DFA based on start symbol.mp4

04:30

28 - DFA based on substring.mp4

06:58

29 - DFA based on start symbols.mp4

04:26

30 - DFA based on end symbol.mp4

09:46

31 - DFA based on end symbols.mp4

11:06

32 - DFA based on end symbols.mp4

07:37

33 - DFA based on end symbols.mp4

04:28

34 - DFA based on substring.mp4

04:21

35 - DFA based on substring.mp4

05:56

36 - DFA based on start symbol and end symbol.mp4

10:36

37 - DFA based on start symbol and end symbol.mp4

04:41

38 - DFA based on start and end symbol.mp4

06:23

39 - DFA which accepts strings which starts and ends with different symbols.mp4

10:31

40 - DFA which accepts strings which starts and ends with the same symbol.mp4

11:26

10 - Complementation

41 - Complementation of a language.mp4

08:27

42 - Example 1 on Complementation of a language.mp4

03:36

43 - Example 2 on complementation of a language.mp4

06:22

44 - DFA based on following symbol.mp4

06:16

45 - Complementation of a DFA.mp4

06:33

46 - Constructing DFA through complementation technique.mp4

07:07

47 - DFA based on following symbol.mp4

15:11

48 - DFA based on substring.mp4

05:49

49 - DFA based on following symbol.mp4

04:12

50 - DFA based on following symbol.mp4

05:30

11 - Advanced DFAs

51 - Problem 1.mp4

11:23

52 - Problem 2.mp4

06:42

53 - Problem 3.mp4

09:30

54 - Problem 4.mp4

06:13

55 - Problem 5.mp4

06:25

56 - Problem 6.mp4

03:05

57 - Problem 7.mp4

02:58

58 - Problem 8.mp4

10:06

59 - Problem 9.mp4

03:22

60 - Problem 10.mp4

01:34

61 - Problem 11.mp4

04:12

12 - Operations between languages

62 - Union between languages.mp4

03:43

63 - Problem on Union Operation.mp4

02:51

64 - Problem on Union Operation.mp4

01:57

65 - Concatenation between languages.mp4

03:37

66 - Problem on Concatenation Operation.mp4

02:13

67 - Reversal of a language.mp4

04:17

68 - Problem.mp4

05:02

13 - Bonus How to proceed further

69 - Bonus How to proceed further.html

Description

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

Who is this 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

More details

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

User Reviews

Rating

average 0

Total votes0

Focused display

Hi! I'm Vignesh. I have a degree in Computer Science, work experience in a multi national company and you might call me a bit of Computer Science enthusiast who is highly passionate in teaching Mathematics and Computer Science After working for a successful multinational company for an year, I resigned the job to follow my passion of teaching students. I have been teaching online for more than 4 years in platforms like youtube where I have a happy bunch of Engineers who are my main motivating factor in following my passion.

Udemy

View courses Udemy

Students take courses primarily to improve job-related skills.Some courses generate credit toward technical certification. Udemy has made a special effort to attract corporate trainers seeking to create coursework for employees of their company.