L={ww^R/wЄ(a b)*} Design a turing machine Theory of computation

TOC LINKS
Design a turing machine for L={a^nb^n/n greater= 1}- • L={a^nb^n/n greater= 1...
Design a turing machine for L={wcw/wє{a,b} *}- • L={wcw/wє{a,b} *} Desi...
Design a turing machine for L={ww^R/wЄ(a b)*}- • L={ww^R/wЄ(a b)*} Desi...
Design a turing machine to find the 2's complement of a binary number- • Find the 2's complemen...
Design a turing machine for unary multiplication- • unary multiplication D...
Design a turing machine for unary division- • Unary division Design ...
Design a turing machine for unary adder- • Unary adder Design a ...
Design a turing machine for unary subtraction- • Unary subtraction Desi...
construct a Push Down Automata a^mb^m/m greater=1- • a^mb^m/m greater=1 Σ={...
Push Down Automata a^nb^nc^m/n,m greater =1 Σ={a,b,c}- • a^nb^nc^m/n m greater ...
Eliminate epsilon Є in context free grammar S-XY X-axx/Є Y-byy/Є - • S-XY X-axx/Є Y-byy/Є E...
Eliminate epsilon Є in context free grammar s-AbaC A-BC B-b/Є C-D/Є D-d - • S-AbaC A-BC B-b/Є C-D/...
Push down automata a^nb^2n/n greater=1- • a^nb^2n / n greater=1 ...
Push Down Automata a^nc^mb^n /n,m greater=1- • a^nc^mb^n /n m greater...
Push Down Automata wcw^R / wε{a,b}+ • wcw^R / wε{a b}+ Push ...
Eliminate epsilon Є in context free grammar- S-XY X-axx/Є Y-byy/Є - • S-XY X-axx/Є Y-byy/Є E...
Eliminate useless symbols in context free grammar- S - ABa/BC B - bcc C - CA D - E A - aC/Bcc/a E- c - • S - ABa/BC B - bcc C -...
Elimination of epsilon Є production S- ACA/Aa A-BB/Є B-A/bc C-b - • S- ACA/Aa A-BB/Є B-A/...
Elimination of unit production context free grammar S - AB A - a B - C/b C - D D - E E - a - • S - AB A - a B - C/b...
Elimination of unit production context free grammar S - Xa/Y Y - X/bb X - a/bc/Y - • S - Xa/Y Y - X/bb X - ...
Elimination of useless production context free grammar S - AB/a A - BC/b B - aB/c C - ac/B - • S - AB/a A - BC/b B - ...
Elimination of useless production context free grammar S - AB/AC A - aAb/bAa/a B - bbA/aaB/AB C - abCA/aDb D - bD/aC - • S - AB/AC A - aAb/bAa/...
Elimination of useless production context free grammar S - ABa/BC A - ac/Bcc/a B - bbc
C - CA D - E E - c - • Eliminate useless symb...
Elimination of epsilon Є production S - ACa/Aa A - BB/Є B - A/bc C - b - • TOC Elimination of eps...
Elimination of unit production E - E+T/T T - T*F/F F - (E)/a - • TOC Elimination of uni...
CONSTRUCT DFA FOR LANGUAGE L Alphabets {a b} String starts with b - • Theory of Computation ...
CONSTRUCT DFA FOR LANGUAGE L Alphabets {a b} String length atmost 2 - • Theory of Computation ...
CONSTRUCT DFA FOR LANGUAGE L Alphabets {a b} String length atleast 2- • Theory of Computation ...
Construct DFA Language L Alphabet {a b} string length exactly 2- • Theory of computation ...
CONSTRUCT MINIMAL DFA Alphabets {a b} String starts with substring ba - • Theory of computation ...
CONSTRUCT MINIMAL DFA Alphabets {a b} strings that ends with b - • Theory of Computation ...
CONSTRUCT MINIMAL DFA Alphabets {a b} strings that ends with substring ba- • Theory of Computation ...
CONSTRUCT MINIMAL DFA Alphabets {a b} strings ends with substring aba- • Theory of Computation ...
CONSTRUCT MINIMAL DFA Alphabets {a b} strings ends with substring ab- • Theory of Computation ...
CONSTRUCT MINIMAL DFA Alphabets {a b} string contains b- • Theory of Computation ...
CONSTRUCT MINIMAL DFA Alphabets {a b} string contains ba- • Theory of Computation ...
CONSTRUCT MINIMAL DFA Alphabets {a b} string contains aba- • Theory of Computation ...
CONSTRUCT MINIMAL DFA Alphabets {a,b} Language contains even length strings- • Theory of Computation ...
CONSTRUCT MINIMAL DFA Alphabets {a,b} Language contains odd length strings- • Theory of computation ...
CONSTRUCT MINIMAL DFA Alphabets {a,b} Language contains string length divisible by 4- • TOC CONSTRUCT MINIMAL ...
CONSTRUCT MINIMAL DFA Alphabets {a b} Language - string length gives remainder 1 divided by 4- • TOC CONSTRUCT MINIMAL ...

[@shortwish5669]

Many videos i have seen... But ur videos gives full clarification..thank you so much mam

[@user-dl1mt3rb5i]

Thank you mam..

[@Sooz_Talks]

Very clear explanation madam 👏👌 thanks for the video ,it's very helpful

[@gokulc7043]

Thank you so much mam . slow , clear and very understandable explanation

[@sbc498]

Best video till date
Thank you mam

[@steven-ul8wh]

Thanks a lot! very clear explaination!

[@anvithaki8935]

Construct a Turing Machine for language L = {a^n b^m a^(n+m) where n,m >= 1}

[@sadathhussain1619]

thankyou mam but in my question in place of (a,b) i have (0,1)

[@nithinrajchittath7820]

Replace 0 and 1 in all places where u find a and b.

[@challaanitha8834]

Tq very much mam... U gave awesome explanation to us keep it up mam

[@UyenNguyen-hr9up]

thank u!

[@rohanism26]

Construct a turing machine that accepts the language EQ={w#w|w∈Σ* and Σ={0,1}}

[@smanohar9673]

Can we assign w with baa ???