Computer Science

Instruction: For each of the following questions define for input strings,

Draw transition diagrams and transition diagrams.

1. Design a Turing machine M recognize the language: L = { | 1^n 2^n 3^n | n1 }.

2. Design the turing machine which convert cc to cd.

3. Design a Turing machine that accepts the language: L= { 0^n *1 ^n | n>1 }