323 views
1 votes
1 votes

1 Answer

1 votes
1 votes
for minimal strings choose minimal from all brackets.

So, aa is fixed from first bracket (only one choice).

From next two brackets, we have two choices each that is 2*2 =4 total possibilities.

so 4 is the answer.

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
1 answer
2
hasina ali asked Mar 21
113 views
Set of binary strings starting with 11 and ending with 00. E.g., 1100,1110100 ,1100100
0 votes
0 votes
1 answer
3
utsav22222 asked Mar 15
199 views
Write regular expression for the set of strings of 0's and 1's with at most one pair of consecutive 1's.