iii logix
This channel is about how to build the logic for a given problem using computer based tools
Pumping Lemma to Illustrate a Given CFL is Not Context Free ┃Theory Of Computation
Push Down Automata(PDA) for WcW^r ┃TOC ┃Theory of Computation
Push Down Automata(PDA) for aⁿbⁿ ┃TOC ┃Theory of Computation
Regular Expression for strings not containing “aba” over the language set £={a,b}* |
DFA for binary values divisible by 4 for symbol set = {0, 1}* |
Regular Expression for strings not containing “abb” over the language set £={a,b}* |
Conversion of Epsilon NFA to DFA(VTU question solved)
Conversion of epsilon NFA to DFA
ATC-CFG for 0^m 1^m 2^n | m greater than or equal to 1 and n greater than or equal to 0 | easy
ATC - CFG for a^n b^m c^k m=n+k where n,k greater than or equal to 0 | easy method |
PDA for #a(w) = #b(w) ; w€ {a,b}*
PDA for a^mb^n | m not equal to n ;m, n greater than 0
ATC PDA design for a^nb^n ; #a(w) greater than #b(w)
ATC PDA design for a^nb^n ; #a(w) less than #b(w)
ATC PDA design for a^nb^n ; n greater than or equal to 0, in simple way
Leftmost and Rightmost Derivations part-2
Leftmost and Rightmost Derivations part-3
Leftmost and Rightmost Derivations part-1
Simplification of CFG, in a simple way
CFG for #a(w) = #b(w), in simple way
CFG for balanced paranthesis, in simple way
CFG for a^ib^jc^k where k = i+j, in simple method
CFG for a^ib^jc^k where i=j or j=k, in simple way
ATC - CFG Design for the language a^nb^n where n is greater than equal to zero
ATC - Design CFG for wcw^R where w € {a,b}*
CFG for ww^R ;w€{a,b}*, in simple method