Set of all non-empty Strings

languages

Definition

Set of all non-empty Strings

The set of all strings ${\Sigma }^{+}$ over an alphabet $\Sigma$ is the set of all possible string concatenations on $\Sigma$ without the empty string.