Question 1

Create the Turing Machine for the following languages to print yes at the start of the tape if valid string and to print no at the start if not valid. Alphabet s is printed as the first character on input tape to indicate the start of the string.

1. Language of braces
   Language of the correctly nested braces e.g.
   Valid string: [ [ [ ] [ ] ] [ ] ]
   Invalid String [ ] ] [ [ ]
   
2. Language
   

DeadLine: 21-12-2016

Submission Instruction:

Drop in my office before deadline in hard form