My YouTube Channel

A collection of tutorials, discussions, and playlists on web development, data structures, and more.

Featured Videos

Theory of Automata & Formal Languages (TAFL)

CFG For Language L = { a^m b^n | m!= n m n >= 0 } || TAFL PYQ

Theory of Automata & Formal Languages (TAFL)

CFG For Language L = { a^m b^n | m!= n m n >= 1 } || TAFL PYQ

Theory of Automata & Formal Languages (TAFL)

Epsilon NFA to Minimized DFA Conversion || AKTU 2015-16 Exam Question || TAFL PYQ

Theory of Automata & Formal Languages (TAFL)

Ambiguous Grammars || AKTU Exam Questions || PYQ TAFL

Theory of Automata & Formal Languages (TAFL)

Language to CFG (L=a^p b^q c^r p+q = r) || AKTU Solved Questions (2023-24) || TAFL PYQ

Theory of Automata & Formal Languages (TAFL)

DFA for strings ending with 00 || AKTU 2015-16 Exam Question || TAFL PYQ

Theory of Automata & Formal Languages (TAFL)

NFA for Language with strings having 3rd last symbol as a || AKTU 2015-16 Question || TALF PYQ

Theory of Automata & Formal Languages (TAFL)

Simplification of Context Free Grammar (CFG) || AKTU 2013-14 Exam Question || TAFL PYQ

Page 1 of 39Next
    YouTube | ExamBytes