Chapter Problems Fri., Sept. 4 Sup. Wed., no Fri., no Mon., no Sup. 3 Mon., no Sup. 3 Fri., no Sup. The height of a non-empty tree is defined as the number of nodes on the longest path from a leaf of a tree to its root, the height of an empty tree is defined to be 0.
T has height h .
Prove that T contains at least h nodes and at most 2 h - 1 nodes. Design a Turing machine that accepts exactly those strings that contain two consecutive a's. Write out your machine in full, both using a complete transition table and using a state diagram.