The discussion centers on proving properties of languages in computational language theory, specifically the reversal of concatenated languages. The example provided illustrates that for languages L1 = 01001 and L2 = 001, the concatenation L1L2 results in 01001001, and its reversal (L1L2)^R yields 10010010. The user seeks to explore the relationship between (L1L2)^R and L2^R L1^R, indicating a need to calculate the latter to further understand the proof.
PREREQUISITESStudents of computer science, particularly those studying formal languages, automata theory, and computational proofs, will benefit from this discussion.
And what is L2^RL1^R? That seems the obvious thing to calculate to see what the question is asking.sbc824 said:Homework Statement
I need to prove this
http://www.freeimagehosting.net/newuploads/66exd.jpg
R represents the reversal of...L1 and L2 represent languages, which can represent strings.
(L1L2) = the concatenation of L1 and L2
Ex.
L1 = 01001
L2 = 001
L1L2 = 01001001
(L1L2)^R = 10010010
The Attempt at a Solution
Let y be a member of E* denote an arbitrary string in the set (L1L2)^R.
This is where I'm stuck...