Define for a context free language
LS {0:1} init (L) = {wu el for some v in 0.1}}
(in other words, init (L) is the set of prefixes of L)
Let L {w/w is noempty and has an equal number of O's and 1 s)
Then init (L) is
b.
set of all binary strings with unequal number of O's and I's
set of all binary strings including the null string
set of all binary strings with exactly one more O's than the number of l's or 1
more than the number of o's
none of these
d
Answers
Answered by
0
Answer:
option B please follow me
Similar questions