Homework #5
Due: March 26

---

#1 (10 points)

Using the following DFA, construct an equivalent PDA:

---

#2 (10 points)

Using the rules on page 256 of the textbook, construct an equivalent Turing Machine diagram. Use it to show that aaabbbcc is not a valid word in the language aⁿbⁿcⁿ.