Subset of A Regular Language

$\begingroup$

I need to show that a subset of a regular language is regular or not. I think it may not be regular but I could not find a counter example.

Do you have any simple example to prove that?

Thanks in advance.

$\endgroup$ 2

2 Answers

$\begingroup$

Let $N$ be some non-regular language over some alphabet $\Sigma$. You should know several examples of non-regular languages.

Then $$N\subset \Sigma^\ast$$

and $\Sigma^\ast$ is regular.

$\endgroup$ 0 $\begingroup$

Let $L_1 = \{ a^mb^n \}_{m,n,}$, $L_2 = \{ a^nb^n \}_n$. $L_2 \subset L_1$.

$L_1$ is regular, $L_2$ is not..

$\endgroup$ 4

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password

Post as a guest

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

You Might Also Like