EasyExamNotes.com
  • Home
  • Subject Chart
  • Video Lectures
  • RGPV Solved
  • UGC NET
  • GATE CSIT 2021

Theory of Computation

TOC

Theory of Computation

  • Definition of Deterministic Finite Automata
  • Notations for DFA
  • How do a DFA Process Strings?
  • Properties of transition functions
  • What is Trap state ?
  • Minimization of DFA
  • DFA solved examples
  • Definition Non Deterministic Finite Automata
  • NFA with ∈-Moves
  • Remove ∈ transitions from NFA
  • NFA with ∈ to DFA Indirect Method
  • Equivalent of DFA and NFA
  • Moore machine
  • Mealy Machine
  • Moore to Mealy machine
  • Mealy to Moore Machine
  • Diiference between Mealy and Moore machine
  • What is Regular Expression
  • Regular expression
  • Regular Expression Examples
  • Regular expresion to CFG
  • Regular expression to Regular grammar
  • closure properties of regular languages
  • What is Regular Set in TOC
  • CNF: Conjuctive Normal Form
  • CNF from S–>aAD;A->aB/bAB;B->b,D->d.
  • Grammar is ambiguous. S → aSbS|bSaS|∈
  • leftmost and rightmost derivations
  • CFL are not closed under intersection
  • Arden’s Law
  • Pushdown Automata

Theory of Computation

  • Definition of Deterministic Finite Automata
  • Notations for DFA
  • How do a DFA Process Strings?
  • Properties of transition functions
  • What is Trap state ?
  • Minimization of DFA
  • DFA solved examples
  • Definition Non Deterministic Finite Automata
  • NFA with ∈-Moves
  • Remove ∈ transitions from NFA
  • NFA with ∈ to DFA Indirect Method
  • Equivalent of DFA and NFA
  • Moore machine
  • Mealy Machine
  • Moore to Mealy machine
  • Mealy to Moore Machine
  • Diiference between Mealy and Moore machine
  • What is Regular Expression
  • Regular expression
  • Regular Expression Examples
  • Regular expresion to CFG
  • Regular expression to Regular grammar
  • closure properties of regular languages
  • What is Regular Set in TOC
  • CNF: Conjuctive Normal Form
  • CNF from S–>aAD;A->aB/bAB;B->b,D->d.
  • Grammar is ambiguous. S → aSbS|bSaS|∈
  • leftmost and rightmost derivations
  • CFL are not closed under intersection
  • Arden’s Law
  • Pushdown Automata

Please Subscribe

EasyExamNotes.com © 2022