The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
Define init (L) = {set of all prefixes of L}
Let L = {w | w has equal number of 0’s and 1’s}, Ʃ = {0,1}
init (L) is:
(a) all binary strings with unequal number of 0’s and 1’s
(b) all binary strings with ԑ-string
(c) all binary strings with exactly 1 more 0’s than the number of 1’s
or one more than number of 0’s
(d) None of above
asked in Theory of Computation by Active (3.5k points) | 45 views

1 Answer

+1 vote

It will give set of all binary string with null

answered by Boss (25.3k points)
i don't know about prefix,suffix and prefix property....please provide a detailed description about this!
Many videos are avilable on you tube .you can search it

Related questions

0 votes
0 answers
0 votes
1 answer
asked Aug 7, 2018 in Theory of Computation by himgta Active (3.5k points) | 52 views
+1 vote
2 answers
asked Jul 14, 2018 in Theory of Computation by himgta Active (3.5k points) | 59 views
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
47,894 questions
52,260 answers
67,679 users