10:37
Basic Concepts in Automata Theory || Mathematical Notations || TOC || FLAT || Theory of Computation
Sudhakar Atchala
13:06
Strings in Automata Theory || Central(Basic) Concepts || Mathematical Notations|| String Operations
12:18
Language in Automata Theory | Central(Basic) Concepts | Mathematical Notations|Theory of Computation
31:03
Sets || Set Representation || Set Operations || power Set || finite || infinite || subset || proper
4:46
Finite Automata Model || Formal Definition || TOC || FLAT || Theory of Computation
8:03
Representation of Finite Automata || Transition Diagram || Transition Table || TOC || FLAT
7:30
What is DFA ( Deterministic Finite Automata ) || FLAT || TOC || Theory of Computation
7:44
Acceptance of a String by a Finite Automata | Language accepted by Finite Automata || Acceptability
9:02
DFA Examples 1 & 2 || Set of all strings Begins with "a" || Starts with "ab" || FLAT||TOC
7:06
DFA Examples 3 & 4 || Set of all strings Containing substring "ab" || substring "abb" || FLAT
9:52
DFA Examples 5 & 6 || Set of all strings ends with ab || ends with 00 || FLAT||Theory of computation
5:16
DFA Examples 7 || Set of all strings Containing "1100" as substring || FLAT ||Theory of computation
5:35
DFA Examples 8 & 9 || Accepts the String "1100" Only || Accepts the String "101" Only || FLAT
7:00
DFA Examples 10 & 11 || Set of all strings with Exactly One "a" || with Exactly Two a's
4:54
DFA Examples 12 & 13 || Set of all strings with At Least One "a" || with At Least Two a's
5:18
DFA Examples 14 || Set of all strings not Containing the sub string "aab" || Except substring "aab"
7:38
DFA for atmost 2(two) a's || atmost 3(Three) a's || Not more than 2 a's || Not more than 3 a's
5:57
DFA Examples 15 || Set of all strings with Even no of a's and Even no of b's || ODD || NUMBER
4:00
DFA Examples 16 || Set of all strings Containing the sub string ab or ba || sub string 01or 10
7:26
DFA Examples 17 & 18|| Set of all strings Starts with 1 and Ends with 0| Starts with a & Ends with b
7:12
Design a DFA for Strings with 3 Consecutive 0's || Without 3 Consecutive 0's || a's || b's || FLAT
9:22
Design DFA to accept all Binary Strings which are divisible by 3 ( Three ) || Theory of computation
6:47
DFA for number of a's are divisibly by 3 || DFA for a's always appears tripled
10:18
Design DFA to accept all Binary Strings which are divisible by 4 ( Four ) || Theory of computation
11:59
Design DFA to accept all Binary Strings which are divisible by 5 ( Five ) || Theory of computation
6:18
DFA of language with all strings starting with 'a' & ending with 'b' || DFA Example
6:22
Design DFA that accepts language L={awa | w ∈ {a,b}*} || String starts with 'a' and ends with 'a'
6:31
DFA which accepts strings starting and ending with same symbol || FLAT || Theory of computation
6:01
What is NFA || Non Deterministic Finite Automata || FLAT || TOC || Theory of Computation
Differences between DFA and NFA || Deterministic Finite Automata || Non Deterministic || Types of
18:37
NFA Examples || Non Deterministic Finite Automata || Theory of Computation || TOC || FLAT
15:56
Converting NFA to DFA || Equivalence of DFA and NFA || Theory of Computation || TOC || FLAT
24:52
converting nfa with epsilon to nfa without epsilon with example || FLAT | TOC||Theory of Computation
11:01
convert nfa with epsilon to nfa without epsilon || Example 2
18:03
Converting NFA with epsilon transitions to DFA || Theory of Computation || FLAT || TOC
6:54
Equivalence of 2 Finite State Machines || Equivalence between Two Finite Automata || DFA || NFA
38:21
Minimization of Finite Automata || Equivalence |Partition || Table Filling |Myhill Nerode |DFA | NFA
16:06
Minimization of DFA(Finite Automata) using Equivalence or Partition method || Example 2
17:29
Minimization of Finite Automata(DFA) using Equivalence or Partition Method || Example 3
18:49
Finite Automata With Output || Moore Machine || Mealy Machine || Theory of Computation || TOC
9:40
Design a Moore Machine to find 1's Complement of a given Binary number || Theory of Computation
12:04
Moore Machine Examples || Count number of occurrences of 'abb' | Print 'a' when the sequence is '01'
8:48
Moore Machine produces A as output if the input ends with 10 or B as output if input ends with 11
Design a Moore Machine to Determine residue modulo 3 of a given binary number
10:24
Design a Moore Machine to determine residue modulo 4 of a given Binary number||Theory of Computation
40:46
Design a Moore Machine || Construct a || Examples of || Theory of Computation || TOC || FLAT
7:15
Construct Mealy Machine that prints 'a' whenever the sequence 01 is encountered in any input string
13:59
Design a Mealy Machine for finding 1's complement || 2's complement || Increment Binary number by 1
9:25
Conversion of Mealy Machine to Moore Machine
6:29
Conversion of Moore Machine to Mealy Machine
5:01
What is Regular Expression in Theory of Computation || Automata Theory || FLAT || Define
12:03
Regular Expression Examples || Theory of Computation || Automata Theory || FLAT || Design a
7:09
Algebraic Laws of Regular Expression || Identity Rules || Theory of Computation || TOC || FLAT
7:52
Simplification of Regular Expressions in TOC || An Example Proof using Algebraic laws ||Identities
10:52
Conversion of Finite Automata to Regular Expression using Arden's Method || TOC || FLAT
7:04
Conversion of Finite Automata to Regular Expression using Arden's Theorem | Construct | TOC | FLAT
14:55
Conversion of Finite Automata(DFA) to Regular Expression using Arden's Theorem || Construct || TOC
8:15
Conversion of DFA to Regular Expression || Equivalence of DFA and Regular Expression || TOC || FLAT
4:56
Converting Regular Expression to Finite Automata Example 1 || Theory of Computation || TOC || FLAT
6:38
Converting Regular Expression to Finite Automata Example 2 || Theory of Computation || TOC || FLAT
12:49
Conversion of Regular expression to Finite Automata using Direct Method || Theory of computation
4:27
Regular Grammar || Left Linear Grammar || Right Linear|| Theory of Computation || TOC || FLAT
Converting Finite Automata to Regular Grammar || Procedure || Example || Construction of Regular Gr
8:28
[New] Convert Right Linear Grammar to Left Linear Grammar | Construction of Left Linear Grammar
Construction of left linear grammar || convert right linear grammar to left linear grammar || TOC
6:37
Converting Finite Automata to Left Linear Grammar | Right Linear Grammar |Regular Grammar|TOC | FLAT
13:41
Converting Regular Grammar to Finite Automata || Procedure || 2 Examples || Construction || TOC
5:48
Construction of Regular Grammar from Finite Automata || Theory of Computation || TOC || FLAT
8:59
Pumping Lemma for Regular Languages with an example || Theory of Computation || TOC || FLAT
8:56
Prove that L={ a^p p is prime} is not regular || Pumping Lemma for Regular Languages || TOC || FLAT
8:10
Show that L={0^n^2} is not regular || perfect square || Pumping Lemma for Regular Languages || TOC
6:13
Show that a language of balanced parenthesis is not regular || pumping Lemma for Regular Languages
32:16
Pumping Lemma for regular languages with examples || prime || perfect square || balanced parenthesis
8:25
Closure properties of Regular Languages || Regular Sets || TOC || FLAT || Theory of Computation
9:23
Definition of CFG with an Example || Context Free Grammar || TOC || Theory of Computation|| FLAT| CD
13:23
Derivation | Derivation Tree |Left Most Derivation|Right Most Derivation |TOC |Theory of Computation
11:43
Construction of CFG for the given language Examples - part 1 || TOC || Theory of Computation|| FLAT
Construction of CFG for the given language Examples - part 2 || TOC || Theory of Computation|| FLAT
8:05
Construction of CFG for the given language Examples - part 3 || TOC || Theory of Computation|| FLAT
8:26
Construction of CFG for the given language Examples - part 4 || TOC || Theory of Computation|| FLAT
41:36
Construction of CFG for a given language || Regular Expression || Examples || TOC || FLAT
Removal of Unit Productions|| Simplification of CFG || TOC || Theory of Computation
Removal of Unit Productions || Simplification of CFG || TOC || Theory of Computation || FLAT
6:49
Removal of NULL ( Epsilon ) Productions|| Simplification of CFG || TOC || Theory of Computation
10:09
Removal of Useless Symbols || Simplification of CFG || TOC || Theory of Computation
10:29
Simplification of CFG || Reduction of CFG || Minimization of CFG || Theory of Computation || TOC
9:44
Ambiguous Grammar || Theory of Computation || TOC || FLAT || CD || Compiler Design
26:31
Elimination of left recursion || Removal of Ambiguity in Grammar || CFG || TOC || Compiler Design
13:33
Elimination of left factoring || Removal of Ambiguity in Grammar || CFG || TOC || Compiler Design
10:03
Chomsky Normal Form || Converting CFG to CNF || TOC || FLAT || Theory of Computation
13:18
Chomsky Normal Form || Converting CFG to CNF || Ex 2 || TOC || FLAT || Theory of Computation
14:32
Greibach Normal Form || Converting CFG to GNF || Ex 1 || TOC || FLAT || Theory of Computation
18:47
Greibach Normal Form || Converting CFG to GNF || Ex2 || TOC || FLAT || Theory of Computation
Greibach Normal Form || Converting CFG to GNF || TOC || FLAT || Theory of Computation || Example 3
8:07
Pumping Lemma for Context Free Language with example (a^n b^n c^n) || TOC || FLAT || Theory of Com.
8:45
Prove that L={ a^p | p is prime} is not Context Free Language || Pumping Lemma for CFL || TOC | FLAT
8:44
Show that L={ a^n^2 } is not Context Free Language || square || Pumping Lemma for CFL |TOC | FLAT
Show that L={ a^i b^j | j=i^2 } is not Context Free Language || Pumping Lemma for CFL || TOC ||FLAT
5:24
Differences between Regular Language and Context Free Language ||by Theory of Computation || FLAT
7:29
Closure properties of Context Free Languages || CFG || TOC || FLAT || Theory of Computation
10:30
Introduction to Pushdown Automata || What | Definition || Model || FLAT | TOC |Theory of Computation
15:26
Construct PDA for the language L={a^n b^n} || Pushdown Automata || TOC || FLAT || Theory of Comp
6:28
Graphical Notation for PDA || Theory of Computation || TOC || FLAT
6:46
Instantaneous Description of PDA || ID of PDA || Push down Automata || Theory of computation || TOC
11:35
Acceptance of PDA || Language accepted by pda || Theory of computation || TOC
10:14
Construct PDA for the language L={a^n b^2n} || Pushdown Automata || TOC || FLAT || Theory of Comp
11:56
Construct PDA for the language L={a^2n b^n} || Pushdown Automata || TOC || FLAT || Theory of Comp
9:09
Construct PDA for the language L={WcW^r} || Pushdown Automata || TOC || FLAT ||Theory of Computation
18:18
Construct PDA for the language L={WW^r} || What is NPDA || Non Deterministic Push down Automata
8:06
DPDA in TOC with Examples || Deterministic Push down Automata || Types of PDA
7:50
Construct PDA for the language L={ w | na(w)=nb(w) } || PDA for equal number of a's and b's
9:57
Design PDA for Balanced Parentheses || Push down Automata || Theory of computation || TOC || FLAT
8:38
Design PDA for number of a's greater than number of b's || Push down Automata || no || TOC || FLAT
9:30
Design PDA for number of a's less than number of b's || Push down Automata || no || TOC || FLAT
11:17
Two Stack PDA || 2 Stack PDA for a^n b^n c^n || Theory of computation || TOC || FLAT
Design of PDA for Language L=a^i b^j c^k | i=j || Theory of computation || TOC ||FLAT | PDA Examples
5:41
CFG to PDA Conversion || Construction of PDA from CFG || Equivalence of CFG and PDA || TOC || FLAT
17:12
PDA to CFG Conversion || TOC || FLAT || Theory of Computation
9:26
Introduction to Turing Machine || Formal Definition || Model || FLAT || TOC || Theory of Computation
12:55
Turing Machine for a^n b^n || Design || Construct || TOC || FLAT || Theory of Computation
11:49
Turing Machine for a^n b^n c^n || Design || Construct || TOC || FLAT || Theory of Computation
11:22
Turing Machine for a^2n b^n || Design || Construct || TOC || FLAT || Theory of Computation
10:00
Turing Machine for a^n b^2n || Design || Construct || TOC || FLAT || Theory of Computation
9:19
Turning Machine for Even Palindrome || ww^r || Length | TOC || FLAT | Theory of Computation| Design
10:12
Turning Machine for Odd Palindrome || waw^r || wbw^r || Length | TOC || FLAT| Theory of Computation
11:07
Turning Machine for all Palindromes || Even & Odd || Length | TOC || FLAT| Theory of Computation
12:47
Design Turing Machine for 1's Complement and 2's Complement || Theory of computation
16:29
Design a Turing Machine for L={ wcw | w belongs to a's and b's } || Theory of computation
12:27
Design a Turing Machine for equal number of a's and b's || Theory of computation || TOC
6:55
Turing Machine for Addition of 2 numbers || Unary || integers || TOC || FLAT ||Theory of Computation
11:38
Turing Machine for Subtraction of 2 numbers || Unary | integers | TOC | FLAT |Theory of Computation
14:16
Design a Turing Machine for Multiplication of 2 unary numbers || TOC || FLAT | Theory of Computation
8:36
Design a Turing Machine which accepts the substring aab || Contains || Theory of computation
6:17
Context Sensitive Language || Context Sensitive Grammar || TOC || FLAT || Theory of Computation
6:40
Linear Bounded Automata || TOC || FLAT || Theory of Computation
13:04
Design Linear Bounded Automata for a^n b^n c^n || LBA || Theory of computation || TOC
8:13
Chomsky hierarchy of languages || Types of languages || TOC || FLAT || Theory of Computation
3:14
Recursive and Recursive Enumerable language || TOC || FLAT || Theory of Computation
8:35
Post Correspondence Problem with 2 examples || PCP || FLAT || TOC || Theory of Computation
Types of Turing Machines | Variants of Turing Machine | Modifications of Turing Machine | TOC |FLAT
Design a Turing Machine for reversing a string || Theory of computation
11:10
Design of PDA for Language L=a^i b^j c^k | j=k || Theory of computation || TOC ||FLAT | PDA Examples
7:37
Design a Turing Machine for Incrementer || Decrementer || function f(x)=x+1 || f(x)=x+2 || f(x)=x-1
