Constructre’s for following languages over σ= {0,1}
i. all words in which "1" never follows "0". ( "0" neverappears before "1")
ii. all words which begin and end withdifferent letters.
b) how many minimumstates can be there in an nfa of language having all word with"101" at the end? (4)

If you turn on the lock alpha button , what happens

You have a small company and want to keep your costs low, but it is important your employees share data. which network would provide you with the most economical solution?

Consider the series where in this problem you must attempt to use the ratio test to decide whether the series converges. compute enter the numerical value of the limit l if it converges, inf if it diverges to infinity, minf if it diverges to negative infinity, or div if it diverges but not to infinity or negative infinity.