Register

CMI2021-A: 3

• edited by
295 views
0 0 votes

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.

  1. $((11)0^{\ast})^{\ast}$

  2. $(10^{\ast})^{\ast}$

  3. $1(01^{\ast})^{\ast}$

  4. $(11+101^{\ast}01+0)^{\ast}$

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · CMI2021-A: 4Next → · CMI2021-A: 2
← Previous in category · CMI2021-A: 4Next in category → · CMI2021-A: 2
Position:
Show:

Related questions

1 1 vote
1 1 answer
435
435 views
admin asked Jul 22, 2022
435 views
CMI2021-A: 1
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
304
304 views
admin asked Jul 22, 2022
304 views
CMI2021-A: 2
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?$\t...
0 0 votes
0 0 answers
438
438 views
admin asked Jul 22, 2022
438 views
CMI2021-A: 4
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
356
356 views
admin asked Jul 22, 2022
356 views
CMI2021-A: 5
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...