Simple splicing systems
From MaRDI portal
Publication:1392573
DOI10.1016/S0166-218X(98)00002-XzbMath0908.68088OpenAlexW2017227531MaRDI QIDQ1392573
Alexandru Mateescu, Grzegorz Rozenberg, Gheorghe Păun, Arto Salomaa
Publication date: 28 July 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items (12)
Descriptional Complexity of Semi-simple Splicing Systems ⋮ Equations in the Partial Semigroup of Words with Overlapping Products ⋮ DNA splicing: Computing by observing ⋮ Computing by splicing ⋮ Descriptional Complexity of Semi-Simple Splicing Systems ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ On the regularity of circular splicing languages: a survey and new developments ⋮ Recognizing DNA Splicing ⋮ P SYSTEMS WITH PROTEINS ON MEMBRANES: A SURVEY ⋮ Splicing representations of stricly locally testable languages ⋮ A characterization of regular circular languages generated by marked splicing systems ⋮ Minimality in template-guided recombination
Cites Work
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Concise description of finite languages
- Splicing semigroups of dominoes and DNA
- Results and trends in theoretical computer science, Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994. Proceedings
- On distributed catenation
- On the splicing operation
- Regularity of splicing languages
- A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
- Splicing systems and regularity
- On finite monoids having only trivial subgroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Simple splicing systems
