# Computer science formal language

Suppose L$$\sum$$* = L for an alphabet $$\sum$$ . What can we say about the possible strings in L?

I know that the $$\sum$$* is a collection of all possible words of a language and I know that 'L' is a subset of $$\sum$$* . So L concatenated with $$\sum$$* needs to be equivalent to L. I am stumped.

Related Engineering and Comp Sci Homework Help News on Phys.org
I like Serena
Homework Helper
Suppose L$$\sum$$* = L for an alphabet $$\sum$$ . What can we say about the possible strings in L?

I know that the $$\sum$$* is a collection of all possible words of a language and I know that 'L' is a subset of $$\sum$$* . So L concatenated with $$\sum$$* needs to be equivalent to L. I am stumped.