Theory of Automata/Computation, Formal Languages, DFA, NFA, CFG, CFL, Pushdown Automata, Turing Machine, Undecidability
Platform: Udemy
Status: Available
Duration: 3.5 Hours
Price: $129.99 $0.00
Note: Udemy FREE coupon codes are valid for maximum 3 days only. Look for "Get Coupon" orange button at the end of Description.
What you'll learn
- Learn what is Theory of Automata and why we study it.
- Learn Langauage and its fundamentals
- Learn Formal Languages and Informal Languages
- Learn to define a Language i.e Descriptive Definition and Recursive Definition
- Learn Regular Expression with elaborate exmples
- Learn Finite Automata and its two with every detail along with examples
- LearnTransition Graph
- Learn Regular VS Non-Regular Languages
- Learn Context Free Languages and Context free Grammars
- Learn Pushdown Automata (PDA) from introduction to solved examples
- Learn Turing Machine along with solved examples
- Learn Decidable, Partially decidable and Undecidable languages
- Basic understanding of Discrete Mathematics and Set theory
In this course, I will teach you the Theory of Automata in a very simple and interactive manner.
With over 25 lectures that comprise of three and half hours of video lectures, we have tried not to leave any minor detail without explaining it. This course includes quizzes at the end of major sections which will help you in your course exams or other competitive exams. Each and every topic has been covered with ample and elaborate examples to make your concepts precisely clear.
In this course on Theory of Automata we cover wide range of topics, including:
Introduction to the Theory of Automata and why we study it?
Language and its fundamental building blocks
Formal Languages and Informal Languages
Defining a Language i.e Descriptive Definition and Recursive Definition of a Language
Regular Expression i.e. what is it? and how to make it?
Finite Automata and its two types i.e. DFA and NFA
Transition Graph
Regular VS Non-Regular Languages
Context Free Languages and Context free Grammars
Pushdown Automata (PDA)
Turing Machine
Decidability and Undecidability i.e. Decidable, Partially decidable, and undecidable languages
Who this course is for:
- Anyone who want to learn Theory of Automata from beginner to advanced level
- Computer Science students who have theory of Automata as a course subject
- Anyone who want to get indepth knowledge of how machine works and how Theortical Models represent these machines
- Anyone who is preparing for GAT or other competitive exams
- Students pursuing Engineering degree in Computer Science
- Anyone who wants to learn Computer Science from theoretical perspective
