Theory of Automata and Computation
Theory of Automata/Computation, Formal Languages, DFA, NFA, CFG, CFL, Pushdown Automata, Turing Machine, Undecidability
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
Requirements
-
Basic understanding of Discrete Mathematics and Set theory
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
