Parallel communicating Watson-Crick automata systems

MaRDI QIDQ5422226zbMATH OpenFDO

Authors Elena Czeizler, Eugen Czeizler

Publication date 26 October 2007

zbMATH Keywords

Watson-Crick automata

Mathematics Subject Classification ID

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

Recommendations

• On the power of parallel communicating Watson-Crick automata systems
• scientific article; zbMATH DE number 1342112
• On the descriptional complexity of Watson-Crick automata
• Watson-Crick automata: Theoretical computational models in DNA computing
• scientific article; zbMATH DE number 2104767

Cited in

(16)

• Non-regular unary language and parallel communicating Watson-Crick automata systems
• State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata
• Watson-Crick jumping finite automata
• Unary Watson-Crick automata
• On the power of parallel communicating Watson-Crick automata systems
• Two-party Watson-Crick computations
• Peptide computers
• \(k\)-Watson-Crick Petri net controlled grammars
• Watson-Crick T0L Systems and Red-Green Register Machines
• scientific article; zbMATH DE number 2104767 (Why is no real title available?)
• Watson-Crick automata: Theoretical computational models in DNA computing
• DNA computing by matching: sticker systems and Watson-Crick automata
• Developments in Language Theory
• Watson-Crick Petri net languages with finite sets of final markings
• Practical aspects of membership problem of Watson-Crick context-free grammars
• Watson-Crick finite automata of small size and variants of string assembling systems

This page was built for publication: Parallel communicating Watson-Crick automata systems

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