ABSTRACT
This chapter gives an introduction into parallel versions of jumping grammars. It presents all the definitions needed. The chapter presents all the fundamental results about parallel jumping grammars. As is obvious, all the jumping derivation modes reflect and formalize the above-described four-phase computation performed in a discontinuous way more adequately than their standard counterpart. Consequently, applications of these grammars are expected in any scientific area involving this kind of computation, ranging from applied mathematics through computational linguistics and compiler writing up to data mining and bioinformatics. The chapter demonstrates that SCGs working under any of the derivation modes defined in the previous section are computationally complete—that is, they characterize the family of recursively enumerable languages. In addition, in its conclusion, it formulates several open problems.
