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
| A. | regular language |
| B. | context-free language |
| C. | context-sensitive language |
| D. | recursively enumerable language |
Answer : A Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
