TOC Reverse of String and Language | Theory of Computation TOC GATE NET

• wR is reverse string of w.
• LR is reverse language of L.
• If w = wR, then w is a palindrome
• ϵ is a palindrome
• (wR)R = w
• (LR)R = L
• |wR| = |w| → Length of w and wR is same
• |LR| = |L| → Number of strings in L and LR is same
• If L is finite, then LR is finite
• If L is infinite, then LR is infinite
• L = {ϵ} → LR = {ϵ}
• L = ϕ → LR = ϕ