Theory of Computation admin Index Pages Definition of Deterministic Finite AutomataNotations for DFAHow do a DFA Process Strings?Properties of transition functionsWhat is Trap state ?Minimization of DFADFA solved examplesDefinition Non Deterministic Finite AutomataNFA with ∈-MovesRemove ∈ transitions from NFANFA with ∈ to DFA Indirect MethodEquivalent of DFA and NFAMoore machineMealy MachineMoore to Mealy machineMealy to Moore MachineDiiference between Mealy and Moore machineWhat is Regular ExpressionRegular expressionRegular Expression ExamplesRegular expresion to CFGRegular expression to Regular grammarclosure properties of regular languagesWhat is Regular Set in TOCCNF: Conjuctive Normal FormCNF from S–>aAD;A->aB/bAB;B->b,D->d.Grammar is ambiguous. S → aSbS|bSaS|∈leftmost and rightmost derivationsCFL are not closed under intersectionArden’s LawPushdown Automata
