• Support PF! Buy your school textbooks, materials and every day products Here!

Computational language theory proof

  • Thread starter sbc824
  • Start date
  • #1
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
41,770
911

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

Related Threads for: Computational language theory proof

  • Last Post
Replies
1
Views
819
  • Last Post
Replies
0
Views
699
  • Last Post
Replies
6
Views
2K
Replies
9
Views
3K
Replies
1
Views
738
Replies
2
Views
3K
Replies
0
Views
2K
  • Last Post
Replies
0
Views
944
Top