Computational language theory proof

  • Thread starter sbc824
  • Start date
  • #1
sbc824
5
0

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...
 

Answers and Replies

  • #2
HallsofIvy
Science Advisor
Homework Helper
43,021
971

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
And what is L2^RL1^R? That seems the obvious thing to calculate to see what the question is asking.

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...
 

Suggested for: Computational language theory proof

Replies
7
Views
523
Replies
12
Views
452
Replies
2
Views
412
Replies
2
Views
399
  • Last Post
Replies
2
Views
240
  • Last Post
Replies
20
Views
612
  • Last Post
Replies
4
Views
326
Replies
6
Views
272
Replies
1
Views
269
Replies
9
Views
617
Top