Regular Expression

ALEX is the set of valid algebraic expressions recursively defined by: (1 pt) Let x and y be two words (both different than the empty string) and xy is their concatenation. Show that if x, y and xy are all in PALINDROME, then there is a word z such that x= zn and y=zm...