Closure and decidability properties of some language classes with respect to ciliate bio-operations

29Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

The process of gene unscrambling in ciliates (a type of unicellular protozoa), which accomplishes the difficult task of re-arranging gene segments in the correct order and deleting non-coding sequences from an "encrypted" version of a DNA strand, has been modeled and studied so far from the point of view of the computational power of the DNA bio-operations involved. Here we concentrate on a different aspect of the process, by considering only the linear version of the bio-operations, that do not involve thus any circular strands, and by studying the resulting formal operations from a purely language-theoretic point of view. We investigate closure properties of language families under the mentioned bio-operations and study language equations involving them. We also study the decidability of the existence of solutions to equations of the form L ◇ Y = R, X ◇ L = R where L and R are given languages, X and Y are unknowns, and ◇ signifies one of the defined bio-operations. © 2003 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Daley, M., Ibarra, O. H., & Kari, L. (2003). Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theoretical Computer Science, 306(1–3), 19–38. https://doi.org/10.1016/S0304-3975(03)00139-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free