2
$\begingroup$

I have a question regarding regular languages. Given that $L_1$ and $L_2$ are non-regular languages, can a regular language $L$ exist so it is a subset of $L_2$ and $L_1$ subset of $L$?

To be more specific:

$\qquad L_1 \subset L \subset L_2$

for $L_1, L_2$ non-regular Languages.

Improve this question
$\endgroup$
1
  • 2
    $\begingroup$ Do you mean $\subseteq$ or $\subsetneq$? Do we know $L_1 \subseteq L_2$? And: What have to tried, where did you get stuck? $\endgroup$
    – Raphael
    Commented Feb 12, 2014 at 7:56

1 Answer 1

Reset to default
3
$\begingroup$

Hint. Given any sets $A, B, C$ we have $A \cap C \subset C \subset B \cup C$.

Improve this answer
$\endgroup$
3
  • $\begingroup$ Thx for you answer you really guided to the solution! $\endgroup$
    – Mario
    Commented Feb 11, 2014 at 19:29
  • 1
    $\begingroup$ Might be interesting to give languages $A \cap C, B \cup C, C$ that fulfill the desired properties. $\endgroup$
    – G. Bach
    Commented Feb 11, 2014 at 20:32
  • 1
    $\begingroup$ Please consider not to encourage undesired posting behaviour. $\endgroup$
    – Raphael
    Commented Feb 12, 2014 at 8:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.