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*
Which of the following regular expressions describes the language of all binary strings that contain exactly three 1’s?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which of the following regular expressions describes the language of all binary strings that contain exactly three 1’s?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!