Programming Languages Quizzes Theory Of Computation

Question:
Let L be a language recognizable by a finite automaton. The language

REVERSE (L) = {w such that w is the reverse of v where v ∈ L } is a

Option A):
regular language
Option B):
context-free language
Option C):
recursively enumerable language
Option D):
context-sensitive language

Correct Answer is Option A):
regular language