|
Introduction
|
|
|
|
Introduction To Theory of Computation
|
|
|
|
Concept of alphabet & strings
|
|
|
|
Operations on sigma
|
|
|
|
Operations on string: concatenation, reversal, substrings, power
|
|
|
|
Concept of prefix and suffix
|
|
|
|
Classification of Formal Languages
|
|
|
|
Operations on Languages: PART 1
|
|
|
|
Operations on Languages: PART 2
|
|
|
Finite Automata
|
|
|
|
Concept of Finite Automata
|
|
|
|
DFA to accept string of length exactly n
|
|
|
|
DFA to accept string of length at least/ at most n
|
|
|
|
DFA to accept string starting with a, ending with a
|
|
|
|
Live Lecture: Designing of Deterministic Finite Automata Part 1
|
|
|
|
Live Lecture: Designing of Deterministic Finite Automata Part 2
|
|
|
|
Live Lecture: Designing of Deterministic Finite Automata Part 3
|
|
|
|
Live Lecture: Designing of Deterministic Finite Automata Part 4
|
|
|
|
Live Lecture: Designing of Deterministic Finite Automata Part 5
|
|
|
|
Assignment 1
|
|
|
|
Live Lecture: Designing of Deterministic Finite Automata Part 6
|
|
|
|
Assignment 2
|
|
|
|
Live Lecture: Assignment 2 Discussion
|
|
|
|
Assignment 3
|
|
|
|
assignment3 discussion
|
|
|
|
Live Lecture: Gate questions discussion
|
|
|
|
Deterministic Automata Design Test 1
|
|
|
|
Deterministic Automata Design Test 2
|
|
|
|
Minimization of DFA
|
|
|
|
Live Lecture: Minimization of DFA
|
|
|
|
Introduction To NFA
|
|
|
|
Definition of NFA
|
|
|
|
Live Lecture: Design of NFA
|
|
|
|
Live Lecture: NFA To DFA Conversion
|
|
|
|
MCQ Assignment on Finite Automata
|
|
|
|
Concept of Epsilon NFA
|
|
|
|
Concept of ∈−Closure
|
|
|
|
Minimal DFA
|
|
|
|
Epsilon NFA to NFA & DFA
|
|
|
|
Live Lecture: ∈−NFA To NFA & DFA
|
|
|
|
Mealy Machine
|
|
|
|
Moore Machine
|
|
|
|
Live Lecture: Mealy-Moore Machine Designing
|
|
|
|
Closure Properties of Regular Languages
|
|
|
|
Mealy Moore Machine Conversion
|
|
|
Regular Expression
|
|
|
|
Introduction To Regular Expression
|
|
|
|
GATE MCQ's on Regular Expressions
|
|
|
|
Mealy Moore Machine and Regular Expression
|
|
|
|
Automata To Regular Expression
|
|
|
Context Free Language & PDA
|
|
|
|
Designing of DPDA
|
|
|
|
Concept of NPDA
|
|
|
|
Identifying Nature of Given Language
|
|
|
|
Identifying Nature of Given Language
|
|
|
|
Context Free Grammer
|
|
|
|
Normal Forms
|
|
|
|
CFG NOTES
|
|
|
|
TEST 1 : CFL
|
|
|
|
Test 1 Solution
|
|
|
|
Context Free Grammer vs Regular Grammer
|
|
|
|
DPDA for Regular Languages
|
|
|
|
TEST 2 : CFG
|
|
|
|
REGULAR GRAMMAR TO DFA AND VICE VERSA
|
|
|
Turing Machine and undecidibility
|
|
|
|
Turing Machine Design and its Properties
|
|
|
|
Undecidibility Part 1
|
|
|
|
Undecidibility Part 2
|
|
|
|
Undecidibility Part 3
|
|
|
|
Turing_Machine
|
|
|
|
Undecidibility Part 4
|
|
|
|
Undecidibility Part 5
|
|
|
Numerical Solving
|
|
|
|
Nmerical Solving Part 1
|
|
|
|
Numerical Solving Part 2
|
|
|
|
Numerical Solving Part 3
|
|
Launch your Graphy