edited by
301 views
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?

  1. $\text{L} \cap  a^{\ast}b^{\ast}$

  2. $(\text{L} \cap  a^{\ast}b^{\ast}) \cup  a^{\ast}b^{\ast}$

  3. $\text{L} \cup  a^{\ast}b^{\ast}$

  4. $(\text{L} \cap  a^{\ast}b^{\ast}) \cup  b^{\ast}a^{\ast}$

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
1 1 answer
433
433 views
admin asked Jul 22, 2022
433 views
If the milkman doesn’t deliver milk or the geyser doesn’t work, then Akash will be late for school and lunch will be cooked late. Suppose lunch was actually cooked on tim...
0 0 votes
0 0 answers
293
293 views
admin asked Jul 22, 2022
293 views
Which of the following regular expressions represents binary strings that are multiples of $3?$ Note that we consider the leftmost bit to be the most significant.$((11)0^...
0 0 votes
0 0 answers
437
437 views
admin asked Jul 22, 2022
437 views
Consider the following statements about finite simple graphs $\text{G}$ :If each vertex of a graph $\text{G}$ has degree at least $2$ then $\text{G}$ contains a cycle as ...
0 0 votes
1 1 answer
354
354 views
admin asked Jul 22, 2022
354 views
One day, Dumbledore assigns Harry Potter the task of obtaining the Philosopher’s Stone that lies in an inner chamber surrounded by many rooms. To guide him along, he is g...