This is solved by defining the multi-string Turing machine with input and output, which is a standard multi-tape Turing machine, except that the input tape may never be written-to, and the output tape may never be read from.
12.
Then, after reading input symbols \ alpha \ beta \ gamma \ cdots from the input tape, the state of the DFA will be given by q = \ cdots U _ \ gamma U _ \ beta U _ \ alpha q _ 0.
13.
This made it possible to write large assembly programs using the two pass assembler ROM . Source code in text was written twice consecutively to the input tape, and then the assembler, which could start / stop the input cassette tape using motor control was invoked.
14.
On this view, a transducer is said to " transduce " ( i . e ., translate ) the contents of its input tape to its output tape, by accepting a string on its input tape and generating another string on its output tape.
15.
On this view, a transducer is said to " transduce " ( i . e ., translate ) the contents of its input tape to its output tape, by accepting a string on its input tape and generating another string on its output tape.
16.
Then there is a program P for U that will make it simulate M . In other words, giving input J to M is the same as giving input P + J to U, in which P + J consists of concatenating P and J on the input tape.
17.
A single edge "'weight "'might represent an array of impulse responses of a complex system ( see figure to the right ), or a character from an input tape of a finite automaton, while the graph might represent the flow of information or state transitions.
18.
The construction requires that each computation step in M'corresponds to at least 2 computation steps of M . So M'takes no more than f ( " n " ) / 2 steps, after an initial linear number of steps to convert the input tape into the compressed representation.
19.
Each time the B & rarr; C reducer needs to access its input tape, the A & rarr; C reducer can re-run the A & rarr; B reducer, and so the output of the A & rarr; B reducer never needs to be stored entirely at once.
20.
This is the same as an ordinary " k "-string Turing machine, except that the transition function \ delta is restricted so that the input tape can never be changed, and so that the output head can never move left . This model allows us to define deterministic space classes smaller than linear.
