Computer science formal language

[francisg3]

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.

 

[I like Serena]

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.

How about:

If w is a word in L, than w followed by zero or more symbols from ∑ is also a word in L?