All references are to the 1997 edition of Cohen.

1. Problem 6(ii) on page 454.

2. Build/design a TM that accepts all words of the form aba(c)+bab, loops forever on all words that start with b, and rejects all other words.

3. Build a 2PDA that accepts the language: {an+1bn+2cn n > 0}.

4. Let T be the Turing machine in problem 13(v) on page 562 - 563. What are the languages accept(T), reject(T) and loop(T)?

5. Problem 13(v) on page 562-563.

Ill references are to the 1997 edition of Cohen. 1. Problem 6(ii) on page 454. 2. Build/design a TM that - accepts all words of the form aba(c)+bab, - loops forever on all words that start with b, and - rejects all other words. 3. Build a 2PDA that accepts the language: {an+1bn+2cnn>0}. 4. Let T be the Turing machine in problem 13(v) on page 562563. What are the languages accept (T),reject(T) and loop(T) ? 5. Problem 13(v) on page 562563