The computational linguistics of biological sequences
Artificial intelligence and molecular biology
Discrete Applied Mathematics
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Remarks on operations suggested by mutations in genomes
Fundamenta Informaticae
Operations and language generating devices suggested by the genome evolution
Theoretical Computer Science
On some operations on strings suggested by gene assembly in ciliates
New Generation Computing
Formal systems for gene assembly in ciliates
Theoretical Computer Science
Closure and decidability properties of some language classes with respect to ciliate bio-operations
Theoretical Computer Science
The ld and dlad bio-operations on formal languages
Journal of Automata, Languages and Combinatorics
Some properties of ciliate bio-operations
DLT'02 Proceedings of the 6th international conference on Developments in language theory
| Hi-index | 0.00 |
We formalize the hairpin inverted repeat operation, which is known in ciliate genetics as an operation on words and languages by defining $\mathcal{HI}(w, P)$ as the set of all words xαyRαRz where w = xαyαRz and the pointer α is in P. We extend this concept to language families which results in families $\mathcal{HI}(L_{1},L_{2})$. For L1 and L2 being the families of finite, regular, context-free, context-sensitive or recursively enumerable language, respectively, we determine the hierarchy of the families $\mathcal{HI}(L_{1},L_{2})$ and compare these families with those of the Chomsky hierarchy. Furthermore, we give some results on the decidability of the membership problem, emptiness problem and finiteness problem for the families $\mathcal{HI}(L_{1},L_{2})$.