Just practicing...

Construction of Strict /Full Binary Tree using Preorder and Postorder Only

From Hearts to Heart- 2024

Om Jai Jagdish Hare...

Stack based Question.

Part-1 Address Calculation in 1 Dimensional Array

DFA | No. of 1`s in String

DFA | Multiple of 3 | Divisible by 3

Epsilon NFA to NFA | T-T Method |

DFA Minimization

DFA Starts with Anything over given Alphabet | Trick

DFA Contains any substring Over given alphabet | Trick

DFA ends with any Substring over Alphabet | Trick

epsilon NFA to DFA Coversion | Steps of TT Method

epsilon NFA to DFA | Exaomple-2

epsilon NFA to DFA | TT Method

NFA to DFA Conversion | Example-2

NFA to DFA Coversion Steps

NFA to DFA Conversion

Numerical problem to compute time complexity.

Digital-Sums | Competitive Coding

B Tree Construction - Example-1

PDF to Word | Offline without external software

Chomsky Hierarchy | Definition of All Grammars

Church Thesis | Automata

Post Correspondence Problem(PCP) |Modified Post Correspondence Problem(MPCP)

Turing machine for Palindrome String | Even length | Odd Length |

Universal Turing Machine

Variants/modification of Turing machine

Recursive and Recursive Enumerable Language.

Pumping Lemma for Context Free Language | Example.

Pumping lemma for Regular Languages | Example.

CFG for Even length Palindrome | {w∈ {a,b}*| w is a palindrome of even length} CFG

CFG for Odd length Palindrome | {w∈ {a,b}*| w is a palindrome of odd length} CFG

CFG for Number of a`s greater than number of b`s | Number of a`s less than number of b`s | Not Equal

CFG for Equal no. of a's & b's

Trick | Left Most Derivation | Right Most Derivation | Parse Tree | Ambiguous Grammar| Example.

Devotional-01

Definition of All Automaton | All in One| DFA NFA Epsilon NFA Mealy Moore PDA NPDA TM LBA

Moore Machine -Example-1 | DFA to Moore

Mealy Machine| DFA to Mealy Machine

Moore and Mealy Machine | Example

Turing Machine | Example

Regular Expression to Epsilon NFA

Turing Machine ends in 10 | FA to Turing Machine

PDA Strings ends in 10 | Trick

Arden’s Theorem Example |Finite Automata to Regular Expression|

CFG to CNF

Wipro - TalentNext - Training PBL app and Mettl Tool

Length of String Exactly, Atleast and Atmost 3 with regular expression.

Length of String divisible by 3.

Number of 1`s Divisible by 3.

Nary Number Divisible by K | Binary Number Divisible by 3.

Binary Number divisible by 3.

DFA for Nth symbol from LHS is 1.

DFA for Nth symbol from RHS is 1 | Trick in 1 Minute.

AVL Tree - Part-3 Animation and side by side Explanation .

Array -Lecture-0 - Introduction.

AVL Tree- Part-2 | Example and Verification

AVL Tree- Part-1 | Introduction and Rotations