Formal properties of PA-matching

DOI10.1016/S0304-3975(00)00185-7zbMath0983.68073OpenAlexW1982366063MaRDI QIDQ5958115

Gheorghe Păun, Satoshi Kobayashi, Victor Mitrana, Grzegorz Rozenberg

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00185-7

zbMATH Keywords

DNA computingChomsky hierarchyoverlapping operationPA-matching operation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

On the closure of pattern expressions languages under intersection with regular languages ⋮ Some Remarks on Superposition Based on Watson-Crick-Like Complementarity

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• Splicing in abstract families of languages
• Regularity of splicing languages
• Normal forms for phrase-structure grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formal properties of PA-matching