When asked to give a recursive definition for the language-01033
This subjective question is related to the book/course
vu cs609 System Programming.
It can also be found in
vu cs609 Mid Term Solved Past Paper No. 1.
Question 1: When asked to give a recursive definition for the language PALINDROM over the alphabet S = {a, b}, a student wrote:
Rule 2 If x is in PALINDROM, 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 PALINDROM. Fix this problem.
Give a recursive definition for the language EVENPALINDROM of all palindromes of even length
Answer:
Rule 1 a and b are in PALINDROM.Rule 2 If x is in PALINDROM, 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 PALINDROM. Fix this problem.
Give a recursive definition for the language EVENPALINDROM of all palindromes of even length
