in Theory of Computation edited
605 views
1 vote
1 vote
Write a regular expression for the string having 3

 consequetive 1s
in Theory of Computation edited
by
605 views

3 Comments

how many consecutive ones??/
0
0
Incomplete question. How many consecutive ones you want?
0
0
i request to write question completely what are its input symbols if u r asking dout also na ask clearly 3 consicutive 1s if i want to ans i can wirte it as 111  (111)*

if i consider 1,2 as input symbols

(1+2)*111(1+2)* as i increse aand put more and more conditions the answe changes so be specific with u r question
0
0

3 Answers

4 votes
4 votes
(0+1)*111(0+1)*
2 votes
2 votes

Regular expression for 3 consecutive 1's will be

(0+1)*111(0+1)*

0 votes
0 votes
you have not mentioned the input symbols but instead of that

i assumed it {0,1}

re= ((0+1)* 111(0+1)*)+