ABSTRACT
To see the principal reason why the multi-head jumping automata represent appropriate models of discontinuous computation in parallel, recall that their original one-head counterparts always apply a single rule during every jump, so they obviously fail to formalize any kind of computational parallelism. More specifically, this chapter opens its discussion by investigating two-head jumping automata, which are generalized to multi-head jumping automata. It explores jumping Watson–Crick finite automata, which represent biology-related model processing double-stranded inputs. Finally, the chapter deals with their special cases—jumping 5'→3' Watson–Crick finite automata that read the double-stranded string from opposite ends so it is closer to the real processing of DNA.
