Theory of Computation - Old Questions
7. Construct a Turing Machine that accepts the language of palindrome over {a, b}* with each string of odd length.
4 marks
|
Asked in 2067