Separating some splicing models.

DOI10.1016/S0020-0190(01)00139-9zbMath1051.68090OpenAlexW2026823742WikidataQ57518632 ScholiaQ57518632MaRDI QIDQ1603389

Rosalba Zizza, Giancarlo Mauri, Claudio Ferretti, Paola Bonizzoni

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00139-9

zbMATH Keywords

Formal languagesMolecular computingSplicing systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Descriptional Complexity of Semi-simple Splicing Systems ⋮ Constants and label-equivalence: a decision procedure for reflexive regular splicing languages ⋮ Deciding whether a regular language is generated by a splicing system ⋮ Circular splicing and regularity ⋮ Recognizing splicing languages: syntactic monoids and simultaneous pumping ⋮ Descriptional Complexity of Semi-Simple Splicing Systems ⋮ Regular splicing languages and subclasses ⋮ The structure of reflexive regular splicing languages via Schützenberger constants

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Computing by splicing
• Regularity of splicing languages
• Unnamed Item
• Unnamed Item