Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing

1. Prerequisites. 1.1. Preliminary Notions and Notations. 1.2. Operations on Strings and Languages. 1.3. A General Computing Framework. 1.4. Chomsky Grammars. 1.5. Lindenmayer Systems. 1.6. Automata and Transducers. 1.7. Characterizations of Computably Enumerable Languages. 1.8. Universal Turing Machines and Type-0 Grammars. 1.9. Complexity -- 2. DNA Computing. 2.1. The Structure of DNA. 2.2. Complementarity Induces Computational Completeness. 2.3. Operations on DNA Molecules. 2.4. Adleman's Experiment. 2.5. Other DNA Solutions to NP Complete Problems. 2.6. A Two-Dimensional Generalization. 2.7. Computing by Carving. 2.8. Sticker Systems. 2.9. Extended H Systems. 2.10. Controlled H Systems. 2.11. Distributed H Systems