Which language accepted by the regular expression ϵ ?Select one:a. 1b. Φc. Φ*d. 0

Which language accepted by the regular expression (0+1)*0(0+1)*0(0+1)*.Select one:a. The set of all strings containing at least two 0’s.b. The set of all strings that begin and end with either 0 or 1.c. The set of all strings containing at most two 0’s.d. The set of all strings containing the substring 00.

A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operationans.Kleene*All of the mentionedUnionConcatenation

Which of the following languages are regular?A = {x | x has two 0’s separated by the number of positions that is a multiple of 4 }.B = {x | x is binary representation of multiple of 3}.C = {x | x is a binary string and decimal of any prefix of x is not of form 3m + 2, where m ≥ 0}.Select one:a. All of the mentioned.b. Only B and C. c. Only A.d. Only B.

Which texts below completely match the following regular expression? (Select ALL correct answers) .*on.+\d{1}.* Hint: Remember that you can use RapidMiner Studio A. con5 B. Condo #5 C. London District 7 B D. #12 Honey Lane

Which of the following is a regular language?