Search code examples
automataformal-languages

Can the intersection of 2 non-regular languages be a regular language?

Can the intersection of 2 non-regular languages be a regular language ?

Solution

  • Suppose that the two non-regular languages are distinct and have no strings in common. The intersection of these 2 languages will be the empty set, since no string exists in both languages.

    The empty set is a regular language, so this can happen sometimes.