The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
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) | 24 views

1 Answer

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

Related questions

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

46,734 questions
51,200 answers
66,556 users