Formal languages
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Patterns of Micronuclear Genes in ciliates
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Closure and decidability properties of some language classes with respect to ciliate bio-operations
Theoretical Computer Science
Some properties of ciliate bio-operations
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Families of languages defined by ciliate bio-operations
Theoretical Computer Science
The generative capacity of block-synchronized context-free grammars
Theoretical Computer Science
Iterated TGR languages: membership problem and effective closure properties
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A ciliate bio-operation and language families
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Hi-index | 0.02 |
We continue the language theoretic study of operations suggested by the gene unscrambling process in stichotrichous ciliates. One of the two complementary models of gene unscrambling is based on operations inspired by the ways in which a DNA molecule can fold: hi (hairpin loop with inverted pointers) which reverses a substring between a pointer sequence and its reverse, ld(loop with direct pointers)-excision which deletes a substring between two pointers and dlad(double loop with alternating direct pointers)-excision / reinsertion which swaps two substrings marked by pointer-pairs. We specifically consider the closure properties of several families of languages under the operations ld and dlad and the solvability of language equations involving these operations.