NVAEducation

NVAEducation

Question No.936

Let L be any language Let us define the transpose of L to be the-00936

Online Quiz This subjective question is related to the book/course vu cs601 Data Communication. It can also be found in vu cs601 Mid Term Solved Past Paper No. 2.

Question 1: Let L be any language. Let us define the transpose of L to be the language of exactly those words that are the words in L spelled backward. If w L then reverse (w) L. for example, if L = {a, abb, bbaab, bbbaa}Then Transpose (L) = {a, bba, baabb, aabbb, Prove that if there is an FA that accepts L, then there is a TG that accepts the transpose of L.
Answer:
Be the first to post an answer to earn 100 credits.

Choose an organization

Virtual University

Virtual University
Gegasoft

Gegasoft
Theme Customizer

Gaussian Texture

Gradient Background