scientific article; zbMATH DE number 1342112
From MaRDI portal
Publication:4263693
zbMath0941.68074MaRDI QIDQ4263693
Rudolf Freund, Gheorghe Păun, Arto Salomaa, Grzegorz Rozenberg
Publication date: 21 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Reversible Watson-Crick automata ⋮ \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ Non-regular unary language and parallel communicating Watson-Crick automata systems ⋮ Unary Watson-Crick automata ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Unnamed Item ⋮ Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ Binding-blocking automata ⋮ State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata ⋮ Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case ⋮ Watson-Crick quantum finite automata ⋮ On 5′→3′ Sensing Watson-Crick Finite Automata ⋮ Two-Party Watson-Crick Computations ⋮ Watson–Crick Jumping Finite Automata ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers
This page was built for publication:
