Computer Science, asked by tanay1198, 1 month ago

• The set of all strings over I = {0,1} in which all strings that beings and ends with O is
Answer
A. 0(0+1)0
B. 00
C. 00(0+1)0
D. All of these​

Answers

Answered by Amrita0000
2

Answer:

b)00

mark as brainleast

Answered by rahul123437
0

The set of all strings over I = {0,1} in which all strings that beings and end with 0 is option A) 0(0+1)0

Explanation:

Option A is the correct option.

A) 0(0+1)0 : The string starts with 0 then 0 or 1 will occur it the end finally 0 comes. The smallest string formed by the grammar is 010 or 000. It can generate all the strings with start and end with 0.

B)00: The string has only two characters 00. It can't generate all the strings which start and end with 0.

C)00(0+1)0: In this language, the string starts with two 00, It won't generate all the strings which can start from 0 and end at 0. The smallest string it can generate is 0000 or 0010. It will not generate the strings starting from one 0.

D) All of these: Only option A can generate the string that begins and ends with 0.

Similar questions