TL;DR Summary: [Formal languages and automata]
Show all sublanguages of the language L={ε, 1, 11, 111} on Σ={0, 1}.
[Formal languages and automata]
Show all sublanguages of the language L={ε, 1, 11, 111} on Σ={0, 1}.
Is the answer {1}, {11}, {111}, {1, 11}, {11, 111}, {1, 11, 111}?
Or {ε}...