I,II,III→ regular IV→ not regular
Try to avoid string matching by putting w as ∈ and make x and y go to (0+1). Therefore we're shown that the subset itself is ∑∗ and thus 1 is regular.
Similary For II we can put x as ∈ and then put w as (0+1)∗.
Therefore II is also regular.
Now in III, put w as ∈ and make xR and yR goto ∑∗ (note that between x and y there's no string matching ). So III is also regular.
But IV is not regular let 's see why.
Try getting rid if string matching by putting w as ∈.
So it we start all over again by putting x as ∈, we are again wwR, another string matching. So we cannot got rid of string matching at all here, as even it both w and x are made ∈ the subset is ∈, but this proves nothing only says that a subset of thus language is regular, but that doesn't say anything at all about the language itself.
So IV is not regular