List 8 relations, one for each subset of the set of properties P = {symmetric, reflexive, transitive}.
Given an alphabet Σ of m symbols, how many palindromes are there of length n? Prove that your answer is correct.
Write a Turing machine program that checks if its input length is divisible by 3. You may write it by hand, but I recommend that you download JFLAP and use that to create and test the TM. Note that the next assignment will include another TM program.