Show sidebar
Show 30 45 60 75

AC-3 Decoder, by Somnath Sengupta

,

Lecture-05-Dfas Solve Set Membership Problems in Linear Time, Pumping lemma., by Somenath Biswas

,

Lecture-12-Construction of a Regular Expression for a Language Given a DFA Accepting it. Algebraic Closure Properies of Regular languages., by Somenath Biswas

,

Lecture-04-Regular Languages, their Closure properties., by Somenath Biswas

,

Lecture-30-More Decision problems. CYK Algorithm for Membership decision., by Somenath Biswas

,

Lecture-24-Simplification of Cfgs Continued, Removal of Epsilon Productions: Algorithm and its correctness., by Somenath Biswas

,

Lecture-03-Finite Automata Continued, Deterministic Finite Automata (DFAs) , Language Accepted by a DFA., by Somenath Biswas

,

Lecture-23-Towards Chomsky Normal Forms: Elimination of Useless Symbols, Analysis of Reachable Symbols, Generating Nonterminals, Order of Substeps matter., by Somenath Biswas

,

Lecture-33-Equivalence of Acceptance by Empty Stack and Acceptance by Final state., by Somenath Biswas

,

Lecture-21-Languages Generated by a Cfg, Leftmost Derivation, more Examples of Cfgs and cfls., by Somenath Biswas

,

Lecture-13-Closure Properties continued., by Somenath Biswas

,

Lecture-08-Formal Description of NFA, Language Accepted by NFA, such Languages are also regular., by Somenath Biswas

,

Lecture-16-About Minimization of States of DFAs. Myhill-Nerode theorem., by Somenath Biswas

,

Lecture-09-‘Guess and Verify’ Paradigm for nondeterminism., by Somenath Biswas

,

Lecture-26-Pumping Lemma for cfls. Adversarial paradigm., by Somenath Biswas

,

Lecture-29-Another Example of a Cfl whose Complement is not a cfl. Decision Problems for cfls., by Somenath Biswas

,

Lecture-22-Parse Trees, Inductive Proof that L is L (G) . all Regular Languages are Context free., by Somenath Biswas

,

Lecture-07-A Generalization of Pumping Lemma, Nondeterministic Finite Automata (NFAs) , Computation Trees for NFAs., by Somenath Biswas

,

Lecture-15-Decision Problems for Regular languages., by Somenath Biswas

,

Lecture-18-Application of Myhill-Nerode theorem. DFA minimization., by Somenath Biswas

,

Lecture-06-More Examples of Nonregular Languages, Proof of Pumping Lemma, Pumping Lemma as a Game, Converse of Pumping Lemma does not hold., by Somenath Biswas

,

Lecture-01 what is Theory of Computation? Set Membership Problem, Basic Notions Like Alphabet, Strings, Formal languages., by Somenath Biswas

,

Lecture-27-Completion of Pumping Lemma proof. Examples of Use of Pumping lemma. Converse of Lemma does not hold. Closure Properties of cfls., by Somenath Biswas

,

Lecture-14-Closure under Reversal, Use of Closure properties., by Somenath Biswas

,

Lecture-28-Closure Properties continued. Cfls not Closed under complementation., by Somenath Biswas

,

Lecture-10-Nfa’s with Epsilon transitions., by Somenath Biswas

,

Lecture-31-Introduction to Pushdown Automata (Pda) ., by Somenath Biswas

,

Lecture-20-Introduction to Context Free Languages (Cfls) and Context Free Grammars (Cfgs) . Derivation of Strings by cfgs., by Somenath Biswas

,

Lecture-02-Introduction to Finite automaton., by Somenath Biswas

,

Lecture-19-DFA Minimization continued., by Somenath Biswas

,