11. This implies words of the code must be longer than the input strings by adding some redundancy. 12. Any call to above string distance function will supply two input strings and a maximum distance value. 13. Also note that a $ is appended to the input string to denote the end of the stream. 14. Consider the above set of valid input characters and the example input string " abcdef ". 15. For example, GAT is an instance of the motif GGT that occurs in the first input string . 16. The DFA can be constructed explicitly and then run on the resulting input string one symbol at a time. 17. Nonetheless, given an arbitrary input string , the output looks random if the seed is taken from a uniform distribution. 18. As a result of this it is necessary to have a function which relates input strings with their corresponding output strings. 19. When a match is found, the matched substring in the input string is replaced with the RHS of the production rule. 20. In this production system, x and y are " variables " matching any character of the input string alphabet.
