Theory of Computation part 2
About Course
Theory of Computation part 2
This is an introductory course on the theory of computation intended for undergraduate students in computer science. In this course, we will introduce various models of computation and study their power and limitations. We will also explore the properties of corresponding language classes defined by these models and the relations between them. It is designed based on the syllabus given by the GATE Computer Science exam.
The Course contains a formal connection between algorithmic problem solving and the theory of languages, automata. It also develops them into a mathematical (and less magical) view towards the algorithmic design and in general computation itself. The course should, in addition, clarify the practical view towards the applications of these ideas in the engineering part of CS.
Who this course is for:
 Anyone who is interested in learning the theory of computation and its concepts.
Course Content
Theory of Computation part 2

Finite Automata with Output – Moore Machine [Examples1] – Theory of Computation
11:17 
Finite Automata with Output – Moore Machine [Examples2] – Theory of Computation
09:22 
Finite Automata with Output – Moore Machine [Examples3] – Theory of Computation
08:24 
Moore to Mealy conversion, Why do we need conversion from Mealy to Moore Machine
09:51 
Examples of Moore to Mealy conversion – Theory of Computation, #MooreMachine, #MealyMachine
06:56 
Mealy machine to Moore machine conversion Examples 1, #MooreMachine, #MealyMachine
12:01 
Mealy machine to Moore Machine conversion Examples 2, #MooreMachine, #MealyMachine
11:12 
Mealy machine to Moore machine conversion Examples 3, #MooreMachine, #MealyMachine
11:29 
Finite Automata with NULL(€) Transition in Theory of Computation, #FiniteAutomata, #NullTransition
14:56 
€ – closure of NULL transition of all states in NFA, #EpsilonClosure, #NullTransition, #NFA
00:00 
NFA€ to NFA Conversion in Theory of Computation, #NFA, #NFAEpsilon
00:00 
NFA€ (NFANULL) to NFA conversion in Theory of Computation, #NFA, #NFAEpsilon
00:00 
NFA € (NFANULL) to DFA Conversion in Theory of Computation, #NFA, #NFAEpsilon, #DFA
00:00 
Regular Expression Theory in Theory of Computation, #RegularExpression
00:00 
Regular Expression Definition Example in Theory of Computation, #RegularExpression
00:00 
Identities of Regular Expression in Theory of Computation, #RegularExpression
00:00 
Regular Expression Example in Theory of Computation, #RegularExpression
00:00 
NFA/DFA to RE, NFA/DFA to Regular Expression conversion in Theory of Computation, #NFA, #DFA, #RE
00:00 
FA to RE – Arden’s Theorem, Finite Automata to Regular Expression Conversion using Arden’s Theorem
07:29 
Arden’s Theorem – [Example 1], NFA to RE conversion Using Arden’s Theorem, #ArdensTheorem
00:00 
Arden’s Theorem – [Example 2], FA to RE Conversion Using Arden’s Theorem, #ArdensTheorem
00:00 
FA to RE Conversion – State Elimination Method, #FiniteAutomata, #RegularExpression
00:00 
FA to RE Conversion – State Elimination Method [Example] in Theory of Computation, #FA, #RE
00:00 
Regular Expression to Finite Automata Conversion, RE to FA Conversion in Theory of Computation
00:00 
RE to FA Examples, Regular Expression to Finite Automata Examples in Theory of Computation
00:00 
Non Regular language – Pumping Lemma, Pumping lemma theory to prove a language to be NonRegular
00:00 
Pumping lemma Example in Theory of Computation, #PumpingLemma
00:00 
Grammar Types, Different types of Grammar & definition in Theory of Computation
00:00 
Pumping Lemma [Example2] in Theory of Computation, #PumpingLemma
00:00 
Grammar Production Rules, Production rules of different types of grammars in Theory of Computation
00:00 
Examples of grammar, Examples of grammar and String belonginess to the language accepted by grammar
00:00 
Ambiguous Grammar, Definition of Ambiguous Grammar, Examples of Ambiguous Grammar
00:00 
Linear grammar, Definition & Example of Linear Grammar, Right & Left Linear Grammar
00:00 
Derivation Tree, Definition of Derivation Tree, Types of Derivation tree, Example of Derivation Tree
00:00