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