Which of the following regular expressions describes the language of all binary strings that contain exactly three 1’s?
Posted: Thu Jul 14, 2022 2:06 pm
Which of the following regular expressions describes thelanguage of all binary strings that contain exactly three 1’s?
0* (10)* (10)* (10)* 0*
(0 + 1)* (0 + 1)* (0 + 1)*
(0* + 1) (0* + 1) (0* + 1)
0* 10* 10* 10*
0* (10)* (10)* (10)* 0*
(0 + 1)* (0 + 1)* (0 + 1)*
(0* + 1) (0* + 1) (0* + 1)
0* 10* 10* 10*