1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Computational language theory proof

  1. Sep 17, 2012 #1
    1. The problem statement, all variables and given/known data

    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


    3. 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...
     
  2. jcsd
  3. Sep 17, 2012 #2

    HallsofIvy

    User Avatar
    Staff Emeritus
    Science Advisor

    And what is L2^RL1^R? That seems the obvious thing to calculate to see what the question is asking.

     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Computational language theory proof
  1. Set theory, proof (Replies: 3)

  2. Graph theory trail proof (Replies: 11)

  3. Graph Theory Proof (Replies: 3)

Loading...