Reply
Mon 5 Sep, 2016 05:20 am
Construct the Turing Machine that accepts the language of palindromes over {a, b}. Also specify the moves trace the strings abaa, abba, aabaa.
Good luck with your school assignment.
@contrex,
No, i saw this question in MTU Second Semester paper.
Stumble It!
Tweet This
Bookmark on Delicious
Share on Facebook
Share on MySpace