DNA Computing
From MaRDI portal
Publication:5494343
DOI10.1007/b136914zbMath1116.68449OpenAlexW4248466611MaRDI QIDQ5494343
Oscar H. Ibarra, Erzsébet Csuhaj-Varjú, György Vaszil
Publication date: 19 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136914
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (7)
Variants of Distributed P Automata and the Efficient Parallelizability of Languages ⋮ On the classes of languages characterized by generalized P colony automata ⋮ P Automata: Membrane Systems as Acceptors ⋮ On the Parallelizability of Languages Accepted by P Automata ⋮ Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems ⋮ Membrane automata for modeling biomolecular processes ⋮ Context-free languages can be accepted with absolutely no space overhead
This page was built for publication: DNA Computing
