Ask
Login
1
6.0kviews
Give an algorithm for a Turing machine that recognizes the language containing all palindromes over the alphabet {a,b} whose length is an even number.
written 3.7 years ago by gravatar for johnywoke126 johnywoke126 • 20 modified 3.7 years ago by gravatar for binitamayekar binitamayekar ★ 6.7k
automata theory
ADD COMMENT EDIT
1 Answer
0
762views
written 3.7 years ago by gravatar for binitamayekar binitamayekar ★ 6.7k •   modified 3.7 years ago

Palindromes over the alphabet {a,b} for an even number

  • A string is called palindrome if reading the string from left to right gives the same result as reading the string from right to left.
  • An even palindrome has an even number of symbols.
  • Some of the examples for even palindrome …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.