Show sidebar

Lecture 5 : Cyclic Scheduler, by Rajib Mall

,

Lecture 6 : Exercises on Frame Size Selectoin, by Rajib Mall

,

Lecture 7: Event-Driven Schedulers, by Rajib Mall

,

Lecture 8 : Rate Monotonic Algorithm, by Rajib Mall

,

Lecture 8.1: Multi-Variable ODE, by Niket S.Kaisare

,

Lecture 9RMA Task Schedulability, by Rajib Mall

,

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

,

Lecture-01, by Sanjeev K Aggarwal

,

Lecture-02-Compiler Design, by Sanjeev K Aggarwal

,

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

,

Lecture-03-Compiler Design, by Sanjeev K Aggarwal

,

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

,

Lecture-04-Compiler Design, by Sanjeev K Aggarwal

,

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

,

Lecture-05-Compiler Design, by Sanjeev K Aggarwal

,

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

,

Lecture-06-Compiler Design, by Sanjeev K Aggarwal

,

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-07-A Generalization of Pumping Lemma, Nondeterministic Finite Automata (NFAs) , Computation Trees for NFAs., by Somenath Biswas

,

Lecture-07-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-08-Compiler Design, by Sanjeev K Aggarwal

,

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

,

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

,

Lecture-09-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-10-Compiler Design, by Sanjeev K Aggarwal

,

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

,

Lecture-11-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-11-Regular Expressions, they Denote Regular languages., by Somenath Biswas

,

Lecture-12-Compiler Design, by Sanjeev K Aggarwal

,

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-13-Closure Properties continued., by Somenath Biswas

,

Lecture-13-Compiler Design, by Sanjeev K Aggarwal

,

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

,

Lecture-14-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-15-Compiler Design, by Sanjeev K Aggarwal

,

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

,

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

,

Lecture-16-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-17-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-17-Continuation of Proof of Myhill-Nerode theorem., by Somenath Biswas

,

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

,

Lecture-18-Compiler Design, by Sanjeev K Aggarwal

,

Lecture-19-Compiler Design, by Sanjeev K Aggarwal

,

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

,

Lecture-20-Compiler Design, by Sanjeev K Aggarwal

,

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

,

Lecture-21-Compiler Design, by Sanjeev K Aggarwal

,

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

,

Lecture-22-Compiler Design, by Sanjeev K Aggarwal

,

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

,