0 0 votes Let $\text{L}$ be the language over $\left \{ a, b \right \}$ that contains the same number of occurrences of $a$ and $b$. Which of the following languages is regular? $\text{L} \cap a^{\ast}b^{\ast}$ $(\text{L} \cap a^{\ast}b^{\ast}) \cup a^{\ast}b^{\ast}$ $\text{L} \cup a^{\ast}b^{\ast}$ $(\text{L} \cap a^{\ast}b^{\ast}) \cup b^{\ast}a^{\ast}$ Others cmi2021 + – admin 301 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.