1. Math
  2. Advanced Math
  3. 21 6 points suppose that we have a sevensymbol quotalphabetquot...

Question: 21 6 points suppose that we have a sevensymbol quotalphabetquot...

Question details

21. (6 points.) Suppose that we have a seven-symbol alphabet on which we have imposed a particular order: Suppose that we now enumerate sequences of these symbols in a way 1 that is based on that original ordering: and o,) , 0 and so on through all of the other two-element sequences and so on through all of the other three-element sequences and so on through all the various lengths of sequences.. .. (a) In this ordering, how many strings have length less than or equal to eight? (b) Use sigma-notation to represent a formula for the number of strings of length less than or equal to k. (o) What is the one-millionth string in this ordering? (Answer this without writing a computer program that generates hundreds of thousands of strings.)
Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution