Question: ( i ) When asked to give a recursive definition for the language PALINDROME over the alphabet Sigma = { a , b }

(i) When asked to give a recursive definition for the language PALINDROME over the alphabet \Sigma ={a, b}, a student wrote:
Rule 1: a and b are in PALINDROME.
Rule 2: If x is in PALINDROME, then so are axa and bxb.
Unfortunately, all the words in the language defined above have an odd length and so it is not all of PALINDROME. Fix this problem.
(ii) Give a recursive definition for the language EVENPALINDROME of all palindromes of even length.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!