edited by
8,698 views
29 votes
29 votes
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s  ($k$ is a fixed integer)
edited by

5 Answers

1 votes
1 votes

1*1k(0 1k)+ 1*    should be the required RE

Related questions

41 votes
41 votes
7 answers
1
Kathleen asked Sep 25, 2014
22,938 views
The string $1101$ does not belong to the set represented by$110^*(0 + 1)$$1(0 + 1)^*101$$(10)^*(01)^*(00 + 11)^*$$(00 + (11)^*0)^*$
37 votes
37 votes
4 answers
2
Kathleen asked Sep 25, 2014
11,111 views
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is t...
23 votes
23 votes
3 answers
3
Kathleen asked Sep 25, 2014
6,326 views
Which of the following statements is false?Every finite subset of a non-regular set is regularEvery subset of a regular set is regularEvery finite subset of a regular set...