Currently Empty: $0.00
- Description
- Curriculum
- FAQ
- Reviews
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”.
Minimization of Finite Automata
Regular Expression to Finite Automata
Regular Expression to Finite Automata Continuation
Regular Expression to Finite Automata Continuation
Finite Automata to Regular Expression
Finite Automata to Regular Expression Continuation
Finite Automata to Regular Expression Continuation
Finite Automata to Regular Expression using Arden's Theorem
Pumping Lemma for Regular Languages
Pumping Lemma for Regular Languages Continuation
Pumping Lemma for Regular Languages Continuation
Leftmost Derivation & Rightmost Derivation
Ambiguous Grammar
Simplification of CFG
Simplification of CFG continuation
Simplification of CFG continuation
Chomsky Normal Form (CNF)
Greibach Normal Form (GNF)
Greibach Normal Form (GNF) Continuation
Introduction to Pushdown Automata (PDA)
Introduction to Pushdown Automata (PDA) Continuation
Equivalence of PDA & CFG
Equivalence of PDA & CFG Continuation
Equivalence of PDA & CFG Continuation
Push Down Automata Solved Examples
Push Down Automata Solved Examples Continuation
Turing Machine Introduction
Turing Machine Introduction Continuation
Turing Machine Introduction Continuation
Instantaneous Description of Turing Machine
Turing Machine Examples
Turing Machine Examples Continuation
Turing Machine Examples Continuation
Turing Machine Examples Continuation
Palindrome using Turing Machine
Addition by Turing Machine
Subtraction By Turing Machine
2's Complement by Turing Machine
Multiplication by Turing Machine
Multiplication by Turing Machine Continuation
Multiplication by Turing Machine Continuation
Division by Turing Machine
Division by Turing Machine Continuation
Division by Turing Machine Continuation
How long do I have access to the course materials?
You can view and review the lecture materials indefinitely, like an on-demand channel.
Can I take my courses with me wherever I go?
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
Please, login to leave a review
admin
