1. Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021–1024
2. Bar-Hillel Y, Perles M, Shamir E (1961) On formal properties of simple phrase-structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung 14:143–177
3. Csima J, Csuhaj-Varjú E, Salomaa A (2003) Power and size of extended Watson–Crick L systems. Theor Comput Sci 290(3):1665–1678
4. Csuhaj-Varjú E (2000) Computing by networks of Watson–Crick D0L systems. In: Ito M (eds) Algebraic systems, formal languages and computation. RIMS Kokyroku 1166, Research Institute for Mathematical Sciences, Kyoto University, Kyoto, pp 43–51
5. Csuhaj-Varjú E (2004) Networks of standard Watson–Crick D0L systems with incomplete information communication. In: Karhumäki J, Maurer HA, Paun G, Rozenberg G (eds) Theory is forever, vol 3113 of Lecture notes in computer science, Springer, Berlin, pp 35–48