Regular language question [closed]


It have been stated that every language has a regular superset Σ∗ . Now if Σ∗ is regular than it means regular language must be the greatest language than all other’s chomsky classifications grammars.

Also then does it means recursive enumerable language subset of regular language and not the opposite