Principles in Theory of Computation

Focused View

Dr. Kowsigan Mohan

6:36:44

8 View

1. Introduction

1. Introduction.mp4

06:56

2. Minimization of Finite Automata

1. Minimization of Finite Automata.mp4

19:52

3. Regular Expression to Finite Automata

1. Regular Expression to Finite Automata.mp4

12:09

4. Regular Expression to Finite Automata Continuation

1. Regular Expression to Finite Automata.mp4

07:29

5. Regular Expression to Finite Automata Continuation

1. Regular Expression to Finite Automata.mp4

12:52

6. Finite Automata to Regular Expression

1. Finite Automata to Regular Expression.mp4

07:26

7. Finite Automata to Regular Expression Continuation

1. Finite Automata to Regular Expression.mp4

08:45

8. Finite Automata to Regular Expression Continuation

1. Finite Automata to Regular Expression.mp4

11:58

9. Finite Automata to Regular Expression using Ardens Theorem

1. Finite Automata to Regular Expression using Ardens Theorem.mp4

05:58

10. Pumping Lemma for Regular Languages

1. Pumping Lemma for Regular Languages.mp4

08:11

11. Pumping Lemma for Regular Languages Continuation

1. Pumping Lemma for Regular Languages.mp4

07:44

12. Pumping Lemma for Regular Languages Continuation

1. Pumping Lemma for Regular Languages.mp4

09:58

13. Leftmost Derivation & Rightmost Derivation

1. Leftmost Derivation & Rightmost Derivation.mp4

11:19

14. Ambiguous Grammar

1. Ambiguous Grammar.mp4

03:32

15. Simplification of CFG

1. Simplification of CFG.mp4

05:24

16. Simplification of CFG continuation

1. Simplification of CFG.mp4

04:59

17. Simplification of CFG continuation

1. Simplification of CFG.mp4

05:01

18. Chomsky Normal Form (CNF)

1. Chomsky Normal Form (CNF).mp4

09:34

19. Greibach Normal Form (GNF)

1. Greibach Normal Form (GNF).mp4

13:18

20. Greibach Normal Form (GNF) Continuation

1. Greibach Normal Form (GNF).mp4

14:16

21. Introduction to Pushdown Automata (PDA)

1. Introduction to Pushdown Automata (PDA).mp4

08:11

22. Introduction to Pushdown Automata (PDA) Continuation

1. Introduction to Pushdown Automata (PDA).mp4

08:07

23. Equivalence of PDA & CFG

1. Convert PDA to CFG.mp4

04:08

24. Equivalence of PDA & CFG Continuation

1. Convert PDA to CFG.mp4

12:05

25. Equivalence of PDA & CFG Continuation

1. CFG to PDA.mp4

06:08

26. Push Down Automata Solved Examples

1. Push Down Automata Solved Examples.mp4

09:12

27. Push Down Automata Solved Examples Continuation

1. Push Down Automata Solved Examples.mp4

08:50

28. Turing Machine Introduction

1. Turing Machine Introduction.mp4

09:55

29. Turing Machine Introduction Continuation

1. Turing Machine Introduction.mp4

04:34

30. Turing Machine Introduction Continuation

1. Turing Machine Introduction.mp4

05:03

31. Instantaneous Description of Turing Machine

1. Instantaneous Description of Turing Machine.mp4

05:56

32. Turing Machine Examples

1. Turing Machine Examples.mp4

07:33

33. Turing Machine Examples Continuation

1. Turing Machine Examples.mp4

06:17

34. Turing Machine Examples Continuation

1. Turing Machine Examples.mp4

06:59

35. Turing Machine Examples Continuation

1. Turing Machine Examples.mp4

09:53

36. Palindrome using Turing Machine

1. Palindrome using Turing Machine.mp4

15:41

37. Addition by Turing Machine

1. Addition by Turing Machine.mp4

06:12

38. Subtraction By Turing Machine

1. Subtraction By Turing Machine.mp4

09:36

39. 2s Complement by Turing Machine

1. 2s Complement by Turing Machine.mp4

06:08

40. Multiplication by Turing Machine

1. Multiplication by Turing Machine.mp4

03:05

41. Multiplication by Turing Machine Continuation

1. Multiplication by Turing Machine.mp4

10:48

42. Multiplication by Turing Machine Continuation

1. Multiplication by Turing Machine.mp4

12:35

43. Division by Turing Machine

1. Division by Turing Machine.mp4

07:00

44. Division by Turing Machine Continuation

1. Division by Turing Machine.mp4

12:06

45. Division by Turing Machine Continuation

1. Division by Turing Machine.mp4

14:01

Description

Automata Theory, Computability Theory, Computational Complexity Theory

What You'll Learn?

Understanding the operation of Finite Automata and Hierarchy of Grammars in solving the problems
Examining the Grammars and Languages using Pumping Lemma
Design Pushdown Automata for Computational Logic
Design Turing Machine for general purpose computer operations
Evaluate decidability, undecidabilty and Polynomial class of Problems

Who is this for?

Learner who is interested in theoretical computer Science

Learner who is interested in solving real world problems

Learner who is interested in developing a programming language

What You Need to Know?

Basic Mathematical Knowledge

More details

Description
Theoretical Computer Science is a field where all the real world computational problems come under it. Theoretical Computer Science is also called as Theory of Computation. Theory of computation speaks about â€œHow efficiently the real world problems can be solved by using an algorithm in a model of computation. The model of computation denotes any mathematical model which is embedded on any electronic hardware through the software. Theory of computation is divided in to three sub fields. They are automata theory, computability theory and computational complexity theory. Automata theory denotes the study of problem solving in abstract machines. Here the abstract machines are called as mathematical model rather than itâ€™s not a hardware. Automata theory has various types of automata such as Deterministic Finite Automata, Non-deterministic finite automata, Pushdown Automata and Linear Bounded Automata. These entire automata can be performed in a single hardware called â€œTuring Machineâ€. Till now nobody proved that, a problem that cannot be solved by a Turing Machine can be solved by a real world computer. The Computability speaks about â€œwhat are all the problems can be solved by a computer and cannot be solved by a computerâ€. This is called as decidability and un-decidability. The computational complexity theory speaks about â€œhow much time and space an algorithm takes to solve a problem. This is called as Time and Space Complexity. These are the topics are discussed in this course â€œPrinciples in Theory of Computationâ€.
Who this course is for:
Learner who is interested in theoretical computer Science
Learner who is interested in solving real world problems
Learner who is interested in developing a programming language

User Reviews

Rating

average 0

Total votes0

Focused display

Dr M Kowsigan working as an Associate Professor in the Department of Computing Technologies, SRM Institute of Science and Technology, has about 15+ years of teaching experience. He received his Bachelor of Technology in Information Technology from Anna University, Master of Technology in Information Technology from Anna University, Master of Business Administration in Human Resource Management from Bharathiyar University Coimbatore and Doctor of Philosophy in Computer Science & Engineering in Anna University, Chennai. He has published around 45 research papers in referred international Journals. His most of the research papers comes under theoretical computer science. He has completed 2 consultancy projects. His area of research includes Theoretical Computer Science, Compiler Design, Distributed Computing, Big Data Technologies, IoT etc.

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.