Regular expressions for some languages [duplicate]

This question already has an answer here:

1. Set of strings over $$\{0,1\}$$ having at least two occurrence of the substring 00.
2. $$\{a^n b^m : n ≥ 4, m ≥ 3\}$$.
3. Set of strings over the alphabet $$\{a,b,c\}$$ containing at least one $$a$$ and one $$b$$.

marked as duplicate by Yuval Filmus, D.W.♦Mar 23 at 18:39

• This is a rather routine exercise. I suggest spending some more time on it. Surely you can solve at least some of these. – Yuval Filmus Mar 23 at 18:30
• The usual rule is one question per post. – Yuval Filmus Mar 23 at 18:31
• We're happy to help you understand the concepts but just solving exercises for you is unlikely to achieve that. You might find this page helpful in asking questions here that relate to exercises or self-learning. – D.W. Mar 23 at 18:40

In the first case, you need two instances of $$00$$, and you don't care what else is there. If those instances can't overlap, this would be $$(\cdot^*) 00 (\cdot^*) 00 (\cdot^*)$$, since $$(\cdot^*)$$ means "anything at all, including nothing". If the instances can overlap, you should union in $$(\cdot^*)000(\cdot^*)$$, to catch cases like $$000$$.
In the second case, you need at least four $$n$$s, then at least three $$m$$s. So just specify that: $$nnnn(n^*) mmm(m^*)$$.