Spread Knowledge

Theory of Automata - CS402 - VU Video Lectures

View Video
3474 Views
Rated 3
What Does Automata Mean?, Introduction To Languages, Alphabets, Strings, Defining Languages.
View Video
1792 Views
Rated 3
Kleene Star Closure, Recursive Definition Of Languages.
View Video
1991 Views
Rated 3
Regular Expression, Recursive Definition Of Regular Expression(RE), Method 3 (Regular Expressions).
View Video
1407 Views
Rated 3
Equivalent Regular Expressions, Method 4 (Finite Automaton).
View Video
1055 Views
Rated 3
Introduction To Computer Theory, Transitions.
View Video
1034 Views
Rated 3
Equivalent Fas.
View Video
983 Views
Rated 3
Fa Corresponding To Finite Languages, Method 5 (Transition Graph).
View Video
844 Views
Rated 3
Accepting All Strings, Accepting None, Starting With B, Not Ending In B,Containing Aa, Containing Aa Or Bb.
View Video
931 Views
Rated 3
Generalized Transition Graphs.
View Video
946 Views
Rated 3
Nondeterminism, Kleene’s Theorem.
View Video
980 Views
Rated 3
Proof(Kleene’s Theorem Part Ii).
View Video
893 Views
Rated 3
Kleene’s Theorem Part Iii.
View Video
1051 Views
Rated 2
Method2 (Concatenation Of Two Fas).
View Video
751 Views
Rated 3
Method3: (Closure Of An Fa).
View Video
781 Views
Rated 3
Nondeterministic Finite Automaton (Nfa), Converting An Fa To An Equivalent Nfa.
View Video
818 Views
Rated 3
NFA With Null String.
View Video
729 Views
Rated 3
NFA And Kleene’s Theorem.
View Video
775 Views
Rated 3
NFA Corresponding To Concatenation Of Fas, NFA Corresponding To The Closure Of An FA.
View Video
702 Views
Rated 3
Memory Required To Recognize A Language, Distinguishable Strings And Indistinguishable Strings.
View Video
1002 Views
Rated 3
Finite Automaton With Output, Moore Machine.
View Video
833 Views
Rated 3
Mealy Machine.
View Video
692 Views
Rated 3
Equivalent Machines.
View Video
922 Views
Rated 3
Nand Box (Not And), Delay Box (Flip Flop Box).
View Video
818 Views
Rated 3
Regular Languages, Complement Of A Language.
View Video
785 Views
Rated 3
Nonregular Languages.
View Video
806 Views
Rated 3
Pumping Lemma.
View Video
762 Views
Rated 3
Pumping Lemma version II.
View Video
676 Views
Rated 3
Pseudo Theorem.
View Video
706 Views
Rated 3
Decidability.
View Video
1556 Views
Rated 3
Context Free Grammar (CFG), CFG Terminologies.
View Video
1004 Views
Rated 3
Polish Notation (O-O-O).
View Video
924 Views
Rated 3
Total Language Tree, Regular Grammar.
View Video
788 Views
Rated 3
Null Production.
View Video
891 Views
Rated 3
Chomsky Normal Form (CNF).
View Video
939 Views
Rated 3
A New Format For Fas.
View Video
817 Views
Rated 3
Nondeterministic PDA.
View Video
779 Views
Rated 3
PDA Corresponding To CFG.
View Video
816 Views
Rated 3
Conversion Form Of PDA.
View Video
631 Views
Rated 3
Conversion Form Of PDA.
View Video
692 Views
Rated 3
Conversion Form Of PDA.
View Video
679 Views
Rated 3
Non-Context-Free Language, Pumping Lemma For Cfls.
View Video
691 Views
Rated 3
Decidablity, Parsing Techniques.
View Video
969 Views
Rated 3
Turing Machine.