(2) With Σ = { a, b, c }, define A = { wc”w” : w ε { a, b. m = lul,n12 1 }. Draw an arc-node diagram with helpful comments of a deterministic 1-tape Turing machine M that decides the language A. Our policy is that we will tolerate some inexactness in the diagram (minor deductions only) if the overall strategy of
OR
OR