0(0)

Theory of Computation part 2

  • Course level: Beginner

Description

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:

  1. Anyone who is interested in learning the theory of computation and its concepts.

What Will I Learn?

  • One can master Finite Automata of Theory of Computation
  • In-depth understanding of the basics of the Theory of Computation concepts
  • Understanding the need to study the theory of computation
  • Understanding the advanced concepts of the theory of computation like Push Down Automata

Topics for this course

34 Lessons

Theory of Computation part 2

Finite Automata with Output – Moore Machine [Examples-1] – Theory of Computation11:17
Finite Automata with Output – Moore Machine [Examples-2] – Theory of Computation9:22
Finite Automata with Output – Moore Machine [Examples-3] – Theory of Computation8:24
Moore to Mealy conversion, Why do we need conversion from Mealy to Moore Machine9:51
Examples of Moore to Mealy conversion – Theory of Computation, #MooreMachine, #MealyMachine6:56
Mealy machine to Moore machine conversion Examples 1, #MooreMachine, #MealyMachine12:01
Mealy machine to Moore Machine conversion Examples 2, #MooreMachine, #MealyMachine11:12
Mealy machine to Moore machine conversion Examples 3, #MooreMachine, #MealyMachine11:29
Finite Automata with NULL(€) Transition in Theory of Computation, #FiniteAutomata, #NullTransition14:56
€ – closure of NULL transition of all states in NFA, #EpsilonClosure, #NullTransition, #NFA00:00:00
NFA-€ to NFA Conversion in Theory of Computation, #NFA, #NFAEpsilon00:00:00
NFA-€ (NFA-NULL) to NFA conversion in Theory of Computation, #NFA, #NFAEpsilon00:00:00
NFA- € (NFA-NULL) to DFA Conversion in Theory of Computation, #NFA, #NFAEpsilon, #DFA00:00:00
Regular Expression Theory in Theory of Computation, #RegularExpression00:00:00
Regular Expression Definition Example in Theory of Computation, #RegularExpression00:00:00
Identities of Regular Expression in Theory of Computation, #RegularExpression00:00:00
Regular Expression Example in Theory of Computation, #RegularExpression00:00:00
NFA/DFA to RE, NFA/DFA to Regular Expression conversion in Theory of Computation, #NFA, #DFA, #RE00:00:00
FA to RE – Arden’s Theorem, Finite Automata to Regular Expression Conversion using Arden’s Theorem7:29
Arden’s Theorem – [Example 1], NFA to RE conversion Using Arden’s Theorem, #ArdensTheorem00:00:00
Arden’s Theorem – [Example 2], FA to RE Conversion Using Arden’s Theorem, #ArdensTheorem00:00:00
FA to RE Conversion – State Elimination Method, #FiniteAutomata, #RegularExpression00:00:00
FA to RE Conversion – State Elimination Method [Example] in Theory of Computation, #FA, #RE00:00:00
Regular Expression to Finite Automata Conversion, RE to FA Conversion in Theory of Computation00:00:00
RE to FA Examples, Regular Expression to Finite Automata Examples in Theory of Computation00:00:00
Non Regular language – Pumping Lemma, Pumping lemma theory to prove a language to be Non-Regular00:00:00
Pumping lemma Example in Theory of Computation, #PumpingLemma00:00:00
Grammar Types, Different types of Grammar & definition in Theory of Computation00:00:00
Pumping Lemma [Example-2] in Theory of Computation, #PumpingLemma00:00:00
Grammar Production Rules, Production rules of different types of grammars in Theory of Computation00:00:00
Examples of grammar, Examples of grammar and String belonginess to the language accepted by grammar00:00:00
Ambiguous Grammar, Definition of Ambiguous Grammar, Examples of Ambiguous Grammar00:00:00
Linear grammar, Definition & Example of Linear Grammar, Right & Left Linear Grammar00:00:00
Derivation Tree, Definition of Derivation Tree, Types of Derivation tree, Example of Derivation Tree00:00:00
Theory of Computation
Free

Enrolment validity: Lifetime