Designing Turing Machines for Specific Languages in Theory of Computation

TOC LINKS Design a turing machine for L={a^nb^n/n greater= 1}-https://youtu.be/E_9li1af0Go Design a turing machine for L={wcw/wє{a,b} *}-https://youtu.be/qbARtF9gZ5U Design a turing machine for L={ww^R/wЄ(a b)*}-https://youtu.be/A3G4U2diw04 Design a turing machine to find the 2's complement of a binary number-https://youtu.be/dpbdmgUJr_M Design a turing machine for unary multiplication-https://youtu.be/hP63onri2Zo Design a turing machine for unary division-https://youtu.be/HcurLytwnSg Design a turing machine for unary adder-https://youtu.be/IxaS5vClNHM Design a turing machine for unary subtraction-https://youtu.be/FE2eruaoWgY construct a Push Down Automata a^mb^m/m greater=1-https://youtu.be/YO-XjLzeVNQ Push Down Automata a^nb^nc^m/n,m greater =1 Σ={a,b,c}-https://youtu.be/c5RuRa9gj_g Eliminate epsilon Є in context free grammar S-XY X-axx/Є Y-byy/Є - https://youtu.be/F0jwsjO4v2M Eliminate epsilon Є in context free grammar s-AbaC A-BC B-b/Є C-D/Є D-d -https://youtu.be/idPQdapavN4 Push down automata a^nb^2n/n greater=1-https://youtu.be/qXHWRi86uTs Push Down Automata a^nc^mb^n /n,m greater=1-https://youtu.be/ozNatUoeGOw Push Down Automata wcw^R / wε{a,b}+ https://youtu.be/Q3qNnAbnF8o Eliminate epsilon Є in context free grammar- S-XY X-axx/Є Y-byy/Є - https://youtu.be/F0jwsjO4v2M Eliminate useless symbols in context free grammar- S - ABa/BC B - bcc C - CA D - E A - aC/Bcc/a E- c - https://youtu.be/2HF2h1iwO1I Elimination of epsilon Є production S- ACA/Aa A-BB/Є B-A/bc C-b - https://youtu.be/R9WT3q4WR3Q Elimination of unit production context free grammar S - AB A - a B - C/b C - D D - E E - a - https://youtu.be/RwiN76EdMNQ Elimination of unit production context free grammar S - Xa/Y Y - X/bb X - a/bc/Y - https://youtu.be/F9CpijMZdAA Elimination of useless production context free grammar S - AB/a A - BC/b B - aB/c C - ac/B - https://youtu.be/xJlxijlj6-c Elimination of useless production context free grammar S - AB/AC A - aAb/bAa/a B - bbA/aaB/AB C - abCA/aDb D - bD/aC - https://youtu.be/bpOa510u2Ek Elimination of useless production context free grammar S - ABa/BC A - ac/Bcc/a B - bbc C - CA D - E E - c - https://youtu.be/UnvCUFfC57Y Elimination of epsilon Є production S - ACa/Aa A - BB/Є B - A/bc C - b - https://youtu.be/lYgKPmKKj84 Elimination of unit production E - E+T/T T - T*F/F F - (E)/a - https://youtu.be/anjIA_JWDz0 CONSTRUCT DFA FOR LANGUAGE L Alphabets {a b} String starts with b - https://youtu.be/pFJWP-AEM0Q CONSTRUCT DFA FOR LANGUAGE L Alphabets {a b} String length atmost 2 - https://youtu.be/eQgY3JerEyo CONSTRUCT DFA FOR LANGUAGE L Alphabets {a b} String length atleast 2-https://youtu.be/b6oYGszsZ2g Construct DFA Language L Alphabet {a b} string length exactly 2-https://youtu.be/YiWJbruyDLo CONSTRUCT MINIMAL DFA Alphabets {a b} String starts with substring ba -https://youtu.be/0UfdV0eye40 CONSTRUCT MINIMAL DFA Alphabets {a b} strings that ends with b - https://youtu.be/qU_ACq687oc CONSTRUCT MINIMAL DFA Alphabets {a b} strings that ends with substring ba-https://youtu.be/c7937laBB24 CONSTRUCT MINIMAL DFA Alphabets {a b} strings ends with substring aba- https://youtu.be/HbC-2Rofwnk CONSTRUCT MINIMAL DFA Alphabets {a b} strings ends with substring ab- https://youtu.be/oIELo77xEa8 CONSTRUCT MINIMAL DFA Alphabets {a b} string contains b- https://youtu.be/EELBXHNeyXE CONSTRUCT MINIMAL DFA Alphabets {a b} string contains ba- https://youtu.be/BdWoW_2Epck CONSTRUCT MINIMAL DFA Alphabets {a b} string contains aba- https://youtu.be/t3G-YjNw5aE CONSTRUCT MINIMAL DFA Alphabets {a,b} Language contains even length strings- https://youtu.be/9ULPaXVRdJw CONSTRUCT MINIMAL DFA Alphabets {a,b} Language contains odd length strings- https://youtu.be/cGaj5wRrbmU CONSTRUCT MINIMAL DFA Alphabets {a,b} Language contains string length divisible by 4- https://youtu.be/MT_z6pat1I0 CONSTRUCT MINIMAL DFA Alphabets {a b} Language - string length gives remainder 1 divided by 4- https://youtu.be/p3Qca5oiMTc