252 views

1 Answer

6 votes
6 votes
a)a$^{+}$b$^{+}$ means atleast one time a’s will repeat and atleast one time b’s will repeat,but they have to be one after the other.So the given string is generated by this regex.

b)a$^{*}$b$^{*}$  means zero or more times a’s will repeat and zero or more times b’s will repeat,but they have to be one after the other.So the given string is generated by this regex.

c)$(a+b)*(a+b)*$ We can ignore one $(a+b)*$ and let the other generate the given string

d)This is the set of all possible strings over Σ={ a,b} so it can generate all possible strings

e)This is a string itself it cannot generate the given string

Correct answer will be  $a,b,c,d$ .
edited by

Related questions

2 votes
2 votes
2 answers
1
Ash666 asked Sep 12, 2021
1,321 views
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language co...
0 votes
0 votes
2 answers
2
rohankrishan asked Jun 29, 2022
256 views
Example: 11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3. This machine required at least six states.
1 votes
1 votes
2 answers
3
1 votes
1 votes
0 answers
4
paressep28 asked Apr 25
64 views
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved? Answer Follow·1 Request ...