Ask your own question, for FREE!
Computer Science 18 Online
OpenStudy (_euler_):

Formal Language Theory: Let L be a non-empty Language over an alphabet Σ. Show that L² ⊆ L³ iff λ ∈ L. I just need a kick-start in the right direction to know how to approach this. λ represents the empty string btw.

NvidiaIntely (nvidiaintely):

What language is this?

OpenStudy (dragoness):

@NvidiaIntely Formal Language. I believe it's to do with this: https://en.wikipedia.org/wiki/Formal_language I've not studied anything like this yet in any depth so I can't really help you OP.

thomaster (thomaster):

It's Greek

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!