Question: Problem 1. The reversal of a string is the string written backwards, for example, rev(abcde) = edcba. (a) Give a simple recursive definition of rev(s)

Problem 1. The reversal of a string is the string written backwards, for example, rev(abcde) = edcba. (a) Give a simple recursive definition of rev(s) based on the recursive definition of s A* and using the concatenation operation. (b) Prove that Vs, t e A*.rev(sot) = rev(t) rev(s)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
