Solve the language equasion for L?

[acemcmac]

I really don't understand what I'm supposed to be doing here....

Solve the language equasion for L
L · {a, b, ba} = {a, ba, b, ab, bb, bab}.

Clearly the right hand is a construction of all pairs of elements from the left set, repeats allowed and {null} implied.

Wtf does that make L? Is the answer just the null element?

The · is concatonation for anyone who isn't used to seeing it like that

 

[CHfan4ever]

woaaa lemme go smoke a joint and come back with an answer in about 30 min thanks

 

[shimsham]

Originally posted by: ifesfor
woaaa lemme go smoke a joint and come back with an answer in about 30 min thanks

wait up

 

[CHfan4ever]

Wait wait i nearly got ther answer

 

[stan394]

an element in RHS side is either
1) an element in LHS, or
2) an element in LHS concatenated with 'b'

i don't know how to express it in your 'logic terms' though

 

[CHfan4ever]

I think your answer is 2.

gimme some more time to confirm

 

[SilentZero]

Not sure what you mean by null? Are you talking about the empty string (epsilon) or null as in empty language, because I don't see an empty language there . The empty string (epsilon) also wouldn't be included since your only working with L and not L*.
L* = includes empty string, L+ doesn't. (Kleene closure)

In automata in general the equal sign between them is a strong sign. I would first find a proof before anything. And L is a common symbol for Language.