Question: Consider the language PALINDROME over the alphabet {a b}. (i) Prove that if x is in PALINDROME, then so is x n for any n.

Consider the language PALINDROME over the alphabet {a b}.
(i) Prove that if x is in PALINDROME, then so is xn for any n.
(ii) Prove that if y3 is in PALINDROME, then so is y.
(iii) Prove that if zn is in PALINDROME for some n (greater than 0), then z itself is also.
(iv) Prove that PALINDROME has as many words of length 4 as it does of length 3.
(v) Prove that PALINDROME has as many words of length 2n as it has of length 2n - 1. How many words is that?

Step by Step Solution

3.33 Rating (171 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

i If x is in PALINDROME then 1 a x b2 is in PALINDROME ... View full answer

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 SQL Database Programming Questions!