- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Show that the set of recursive languages is closed under reversal?

Consider a Language L, over an alphabet T is known as recursive enumerable if there exists a turing machine (TM) which generates a sequence of numbers T* which have precisely the members of L.

Whereas L is said to be recursive if there exists a Turing Machine enlisting all members of L and stopping on each member of L as the input.

Thus it is clear from the above statements that every recursive language is also recursively enumerable but the converse is not true.

The precise connection between families of languages is given below.

**Theorem**

**Step 1**− A language L is said to be recursive over an alphabet T if and only if both L and its complement L with respect to T* are recursively enumerable.**Step 2**− The reversal of language L^(R) is set of all strings of elements of T* that we can get by writing all elements of L in reverse order.**Step 3**− Let us consider a language L that is recursively enumerable whose all elements are enlisted by Turing machine M.**Step 4**− We can now design another Turing machine M’ whose strings are accepted as the reverse strings of members of L.**Step 5**− This is also in accordance with church-turing thesis that states that every effective computational procedure can also be made by some Turing machines**Step 6**− Now from the above discussion it is clear that L is recursive enumerable than its reversal L^(R) is also recursively enumerable.**Step 7**− If a string X of T* is in (L^(R))’ if and only if X does not L^(R) which clearly means if and only if the reversal of X^(R) does not belong to L, which further implies that X^(R) belongs to L’⇔ X belongs to l^(R).That is (L^(R))’ = L’^(R)

**Conclusion**

If L is recursive then L’(R) and its complement (L^(R))’ is also recursively enumerable which further means that the reversal of L^(R) is also recursive.

- Related Articles
- How to show that the regular language is closed under the complementary operation?
- Show that the set of all languages that are not recursively enumerable on {a} is not countable?
- Choose the statement that is true.Integers are closed under multiplication but not under division.Integers are closed under division but not under multiplication.Integers are closed under both multiplication and division.Integers are closed neither under multiplication nor under division.
- Prove that CFL is closed under union and star but not under intersection?
- Why subtraction is not closed under whole number?
- How to show a figure that has been closed in Matplotlib?
- Which of the following statements is false.(a) Addition is commutative for integers(b) Subtraction is commutative for integers(c) Integers are closed under addition condition(d) Integers are closed under subtraction condition
- What is the Time Reversal Operation on Signals?
- How to set up different languages in Video.js player?
- What is the difference between Imperative languages and Functional languages in compiler design?
- Will the compass needle show deflection when the switch in the circuit shown in Fig.14.24 is closed?"
- Time Reversal Property of Z-Transform
- Why is Sanskrit known as the mother of all languages?
- Set whether the text should be overridden to support multiple languages with CSS
- How to set what browsers will show that do not support the ruby element?