scientific article; zbMATH DE number 1390082

MaRDI QIDQ4934348zbMATH OpenFDO

Authors Andrei Păun, Mihaela Păun

Publication date 26 April 2000

zbMATH Keywords

non-deterministic finite automataWatson-Crick finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the descriptional complexity of Watson-Crick automata
• State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata
• scientific article; zbMATH DE number 1342112
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• scientific article; zbMATH DE number 2104767

Cited in

(9)

• Non-regular unary language and parallel communicating Watson-Crick automata systems
• State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata
• On the descriptional complexity of Watson-Crick automata
• Reversible Watson-Crick automata
• Unary Watson-Crick automata
• On the power of parallel communicating Watson-Crick automata systems
• Two-party Watson-Crick computations
• scientific article; zbMATH DE number 1342112 (Why is no real title available?)
• Practical aspects of membership problem of Watson-Crick context-free grammars

This page was built for publication:

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