Back to Questions
Computer Science Fundamentals Algorithms Objective
Mar 06, 2013

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

Choose the correct answer:
A) regular language
B) context-free language
C) context-sensitive language
D) recursive enumerable language
Detailed Explanation

Option a is right answer.

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts
Feedback