How can this be? I don't think it is actually possible for a non-regular language to be a subset of a regular language. What examples are there where this is true?
Asked
Active
Viewed 2,565 times
1 Answers
5
Every language over an alphabet $\Sigma$ is, by definition, a subset of $\Sigma^*$, which is regular. If you want a less trivial example,
$$\{a^nb^n\mid n\geq 0\}\subseteq L(a^*b^*)\,.$$
Raphael
- 73,212
- 30
- 182
- 400
David Richerby
- 82,470
- 26
- 145
- 239