5,876 views
0 votes
0 votes
can anyone help me with regular expression for-

a)set of all strings with equal number of 0s and 1s such that no prefix has 2 more than 0s than 1s nor 2 more than 1's than 0's.

b) set of all strings of 0s and 1s whose number of 0s is divisible by 5 and whose number of 1's is even.

2 Answers

0 votes
0 votes
I think for B this is the answer

((11)* 0 (11)* 0 (11)* 0 (11)* 0 (11)* 0 (11)*)*

Related questions

1 votes
1 votes
1 answer
1
prabhath challa asked 6 days ago
53 views
what will be the regular expression of this DFA using Arden's theorem
0 votes
0 votes
1 answer
2
hasina ali asked Mar 21
89 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
131 views
Write regular expression for the set of strings of 0's and 1's with at most one pair of consecutive 1's.