### Abstract

In this paper a new language operator, a generalized morphic replication, is introduced. Let Ω be a finite set of morphisms and reversal morphisms from ∑* into Δ*, and ω be in Ω*. A morphic replicator is defined as follows: for each x in ∑* define ω(x) to be h_{1}(x) ... h_{m}(x), where |ω| = m and ω = h_{1} ... h_{m}. A generalized morphic replication extends ω to languages by ω(L) = {ω(x): x is in L} and to sets W of morphic replicators, where W ⊆ Ω*, W(x) = {ω(x): ω is in W} and W(L) = UW(x), where the union is taken over all x in L.It is shown that the class of languages accepted in real time by a non-deterministic reversal-bounded multitape Turing machine, the class of NP, and the class of the recursively enumerable sets, are all closed under the generalized morphic replication when the morphisms and the reversal morphisms are, respectively, linear-erasing, polynomial-erasing, and arbitrary.

Original language | English (US) |
---|---|

Pages (from-to) | 325-329 |

Number of pages | 5 |

Journal | Computer Journal |

Volume | 31 |

Issue number | 4 |

DOIs | |

Publication status | Published - Aug 1 1988 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)