Assignment Theory of computation TOC

1. Assignment
Theory of Computation
1. Designa TuringMachine whichrecognizesthe language L={an
bn
cn
| n>=1}.
2. Designa Turingmachine whichchecksif stringispalindrome?Given∑= {a,b}.
3. Designa PDA to recognize L= {am
bm
cn
dn
| n>=1}. Alsowrite the grammar forthe language.
4. Designa DFA whichcan check the givenbinaryinputstringisdivisibleby4.
Note : - Designall the machine inJFLAP.Take snapshotof
1. Final Designof machine
2. Providinginputstring
3. Inputprocessing( at leastone )
4. Machine at final state (Acceptedorrejected).
Paste all the imagesinthe word file andsave file withyoursectionandroll no.
Please sendsingledocumentof wordfile forall assignmentstoclassroom.