| 1. | A pushdown automaton reads a given input string from left to right.
|
| 2. | Input strings that the template cannot format are returned unaltered.
|
| 3. | The parsing of the input string proceeds as follows.
|
| 4. | The third algorithm is to match the pattern against the input string by backtracking.
|
| 5. | The first symbol from the input string that the parser sees is'1 '.
|
| 6. | It accepts any number of input strings.
|
| 7. | All finished now . " Additional testing with various other input strings bears out this conclusion.
|
| 8. | This template checks whether any given input strings are valid speedy deletion ( CSD ) criteria.
|
| 9. | It is also possible to compare the input strings to a custom selection of CSD criteria.
|
| 10. | Every Turing machine computes a certain fixed partial computable function from the input strings over its alphabet.
|
