[IT] Card game extra points

1. Label: "Label all edges heading to the right with a zero and those heading to the left with ones."
2. Column: "Initialize the first column of M all zero if the first character of the text is not equal to the first character of the pattern."
3. Binary: "For binary text and a binary pattern"
4. Rule: "Special rules to save more time by shifting more positions: Bad character rule, Good suffix rule"
5. Efficient: "Knutt-Morris-Pratt, usually less efficient, but much easier to explain and prove."
6. Pattern: "
7. When a substring of the pattern aligns and then there is a mismatch 
8. at position i, move the pattern i - sp’ i positions to the right.
"
9. Fuzzy: "
10. Example: binary input, fuzzy or stuttering output
"
11. Lossless: "
12. If all bits of L can be recovered from S, the compression is lossless.
"
13. Dictionary: "
14. The dictionary is included in the beginning of the compressed 
15. file, unless it is implicitly constructed in a standard way
"
16. Code word: "
17. Each word is replaced by a (shorter) code word. 
19. The code words usually cannot share prefixes
"
20. Obtain: "
21. Concatenate the edge labels for the path from the root to a leaf to 
22. obtain the code word for the symbol at that leaf.
"
23. Preprocessing: "
24. The use of shortcut rules generally requires preprocessing.
"
25. Average: "
26. Average information content:
"
27. Logarithm: "
28. The base of the logarithm is not that crucial; interpret it as units,
29. base two being the bit (binary digit)
"
30. Root: "For any leaf i, the labels on the path from the root to that leaf concatenate to exactly the suffix S[i..m]."
31. Symbol: "
32. An implicit suffix tree for S is obtained from a suffix tree by 
33. removing the terminal symbol $ from all edge labels, removing 
34. any unlabelled edge, and removing subsequently all nodes that 
35. do not complete at least two children.
"
36. Equal: "
37. If the two are equal for a given r and P is of length n, then there is 
38. a match to P starting at r in T."
39. Worst case: "
40. How does this differ from the worst case complexity?
"
41. Rate: "
42. The rate of information flow; the maximum value of...
"
43. Compute: "To compute M( j ), we perform a binary AND on Bit-Shift( j -1) and U ( T ( j ) )."
44. Correct: "
45. The probability of correct transmission is denoted as p
"
46. Optimal: "
47. Optimal input frequencies
"
48. Buffer: "
49. Online compression = the string arrives bit by bit, 
50. possibly with a limited-capacity buffer
"
51. Apply: "
52. We must apply mod p during the computations of the H values 
53. for this to save us anything at all.
"
54. Complexity: "
55. Install and experimentally determine the “typical-case” 
56. complexity.
"