Register

#Test series

547 views
1 votes
1 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
User Avatar

1 Answer

2 votes
2 votes

It will give set of all binary string with null

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
himgta asked Aug 31, 2018
254 views
#Test series
https://gateoverflow.in/21039/simplified-cfg Doubt in the solution....plz help!
https://gateoverflow.in/21039/simplified-cfgDoubt in the solution....plz help!
User Avatar
0 votes
0 votes
1 answer
2
himgta asked Aug 7, 2018
379 views
#Test series
User Avatar
0 votes
0 votes
0 answers
3
himgta asked Jul 31, 2018
407 views
#Test series
https://gateoverflow.in/188609/me-test-series This question has not been answered, can somebody solve it!
https://gateoverflow.in/188609/me-test-seriesThis question has not been answered, can somebody solve it!
User Avatar
1 votes
1 votes
2 answers
4
himgta asked Jul 31, 2018
2,045 views
#Test series
Consider the following CFG. S → aSa | bSb | a | b | ε For the above CFG, the total number of strings generated whose length is less than or equal to 8 [exclude the empty string] is _____________.
Consider the following CFG.S → aSa | bSb | a | b | εFor the above CFG, the total number of strings generated whose length is less than or equal to 8 [exclude the empty...
User Avatar
Link Copied!