2-Stack Push Down Automata (PDA) || a^n b^n c^n || Example 1

Unique Paths || Leetcode || Problem Solving

Generate Parenthesis || Leetcode || Problem Solving

K-Closest Points to Origin || Leetcode || Problem Solving

Writing Comparator for Sorting in C++ STL || Problem Solving

Sum of Array Element using Recursion || Problem Solving using C/C++

TAFL Exam Preparation Strategy || Important Topics & Important Questions

PDA to CFG Conversion - AKTU 2015-16 Exam question - Example 3

CFG to PDA Conversion - AKTU Exam question - Example 3

Closure Properties of Regular Languages (Inverse Homomorphism) - Part 4/4

Closure Properties of Regular Languages (Homomorphism) - Part 3/4

Closure Properties of Regular Languages (Reversal) - Part 2/4

Closure Properties of Regular Languages (Union, Intersection, Concatenation, Complement) - Part 1/4

Trie Insertion and Search || Advance Data Structure || Problem Solving

Closure Properties of Context Free Languages (CFL) || Intersection, Complementation || Part2

Closure Properties of Context Free Languages (CFL) || Union, Concatenation, Kleens Closure || Part1

Push Down Automata (PDA) To Context Free Grammar (CFG) Conversion || Example 1

Universal Turing Machine || Theory of Computation

Post Correspondence Problem - PCP || Undecidability

Church's Turing Thesis || Theory of Computation

Context Free Grammar (CFG) to Push Down Automata (PDA) - Part 2

Context Free Grammar (CFG) to Push Down Automata (PDA) - Part 1

Turing Machine - AKTU 2018-19 Exam Question - Example 13

Turing Machine - AKTU 2016-17 Exam Question - Example 12

Turing Machine for Regular Languages