Algorithms for Splicing Systems

DOI10.1137/0221033MaRDI QIDQ4016911zbMATH OpenOpenAlexFDO

Authors R. W. Gatterdam

Publication date 16 January 1993

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0221033

zbMATH Keywords

DNAfinite automatonsplicing systemsstrictly locally testable

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10) Biology and other natural sciences (92-XX)

Recommendations

• scientific article; zbMATH DE number 1088281
• New Computational Paradigms
• On the splicing operation
• DNA computing based on splicing: The existence of universal computers
• scientific article; zbMATH DE number 176945

Cited in

(18)

• Splicing semigroups of dominoes and DNA
• Splicing representations of stricly locally testable languages
• Computing by splicing
• Cut, paste and filter.
• Splicing of Markov and weak Markov systems
• Splicing systems and regularity
• scientific article; zbMATH DE number 176945 (Why is no real title available?)
• scientific article; zbMATH DE number 1286204 (Why is no real title available?)
• scientific article; zbMATH DE number 1047931 (Why is no real title available?)
• scientific article; zbMATH DE number 1088281 (Why is no real title available?)
• Circular splicing and regularity
• ON SMALL UNIVERSAL SPLICING SYSTEMS
• Splicing-array systems
• Complexity Theory for Splicing Systems
• DNA Splicing Systems
• Matrix splicing system
• Theory Is Forever
• Aspects of Molecular Computing

This page was built for publication: Algorithms for Splicing Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016911)