The Luhn mod N algorithm generates a check digit ( more precisely, a check character ) within the same range of valid characters as the input string.
32.
If any of the input strings are valid, the template outputs " yes "; if none of them are valid, it does not output anything.
33.
Each " syntax equation " is translated into a recursive subroutine which tests the input string for a particular phrase structure, and deletes it if found.
34.
Since complexity is usually measured in terms of the length of the input string, the unary version of a language can be " easier " than the original language.
35.
Description : this command is used for recording input strings, each register will hold a pair of characters and the address of the first character is stored in R0.
36.
Find all strings x such that | x | = l and every input string contains at least one variant of x at a Hamming distance of at most d.
37.
Is it really only supposed to go character by character through an input string, randomly choosing a value until it matches the original, then proceed to the next character?
38.
The padding function appends enough bits to the input string so that the length of the padded input is a whole multiple of the bitrate, " r ."
39.
An example of an accepting state appears in Fig . 5 : a deterministic finite automaton ( DFA ) that detects whether the binary input string contains an even number of 0s.
40.
"pFindColPos " is trying to find the cell matching the input string, and return the range . " NextMonday " returns the date of the next Monday as of today.
