Question

Construct a turning machine for the following language:

L = {0^n 1^n 2^n | n >= 1}

Answer 1

Solution: L = { oh, nah In >=1} Let us assume that the input is (BIBIR) COOR) CCICIR) (LR) llilil) (07014) GCBIBU Stait 10, AIR) ใน q (IIBIR) 92 (21 CT2) 9 (21214 (BIBIR) CATAIR) BIBIR) CCICAR) CALAIR) HALT

The Simulation for 601122' can be written as 001122A F convert o to A more right transition from Yo to q, more right upto & AOI1221 1 AD1122A → Convert I to B; more right transition from q to 92 Move right upto & AOB 1220 AOB/22A 1 Convert a to c, more right transition from a to 93 move left Uploc AOBIC2A E AOBCA 1 move move left All A+ Skipping 0111 Bic See State 92 then one step right. Convert o to Ai move right AOBICZA 1 AABIC20 more right . AABICZA 1 convert I to B, and more right transition from a, to 9

AA BBC2A more right F AABBC&A 1 AABBCCA k Convert a to ci move left till A, refer 92 State More right , keep B as it is refer transition from 9o to a Go on moving right by ignoring Bic, refer qu state s Since A is read TM will reach to HALT Stute, AABBCCD R AABBCCA n