The minimum number of 1’s to be used in a regular expression of the given language:

Question

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

R(x): The language of all strings containing exactly 2 zeroes.

TuteeHUB · Answer

2

TuteeHUB · Answer

3

TuteeHUB · Answer

1

1.	The minimum number of 1’s to be used in a regular expression of the given language:
A.	R(x): The language of all strings containing exactly 2 zeroes.
B.	2
C.	3
D.	0
E.	1
Answer» C.

Discussion