Question

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

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

(a) 2

(b) 3

(c) 0

(d) 1

The question was posed to me in an online quiz.

The query is from Finding Patterns in Text,Algebric Laws and Derivatives topic in section Regular Expressions and Languages of Automata Theory

Answer 1

The correct choice is (b) 3

Best explanation: It is not required to automate the question if asked theoretically.The number of zeroes fixed is 2. Therefore, we can represent the regular expression as 1*01*01*.