The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
21 views
Write the regular expression for the language containing the string over{0,1} in which there are atleast two occurence of 1's between any two occurence of 0's.
asked in Theory of Computation by (7 points) | 21 views

1 Answer

0 votes
$1^{*}$$(\epsilon  + 0 + 011^{+}(011)^{*} +  011^{+}0(110)^{*})$
answered by Boss (13.8k points)
edited by


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

37,977 questions
45,471 answers
131,384 comments
48,426 users