Abstract is missing.
- Introduction: Impact of GP's Scientific WorkSolomon Marcus. 1-4 [doi]
- Knowing All Optimal Solutions Does Not Help for TSP ReoptimizationHans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock. 7-15 [doi]
- A Recurrent Enumeration of Free HypermultisetsVincenzo Manca. 16-23 [doi]
- Context InsertionsPaolo Bottoni, Radu Gramatovici, Anna Labella, Florin Manea, Victor Mitrana. 24-34 [doi]
- A General Framework for Regulated Rewriting Based on the Applicability of RulesRudolf Freund, Marian Kogler, Marion Oswald. 35-53 [doi]
- CD Grammar Systems: Competence and ConfidenceErzsébet Csuhaj-Varjú. 57-69 [doi]
- Cooperating Distributed Grammar Systems: Components with Nonincreasing CompetenceMaurice H. ter Beek, Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil. 70-89 [doi]
- On the Expressive Power of Valences in Cooperating Distributed Grammar SystemsHenning Fernau, Ralf Stiebe. 90-106 [doi]
- Generative Power of Eco-ColoniesAlica Kelemenová, Sárka Vavrecková. 107-121 [doi]
- Selected Topics in Computational Complexity of Membrane SystemsPetr Sosík. 125-137 [doi]
- A Temporal Logic for Mutual Mobile Membranes with Objects on SurfaceBogdan Aman, Gabriel Ciobanu. 138-150 [doi]
- Computing the Maximum Bisimulation with Spiking Neural P SystemsRodica Ceterchi, Alexandru Ioan Tomescu. 151-157 [doi]
- P Colonies and Their ExtensionsLudek Cienciala, Lucie Ciencialová. 158-169 [doi]
- On the Parallelizability of Languages Accepted by P AutomataGyörgy Vaszil. 170-178 [doi]
- On Some Biologically Motivated Control Devices for Parallel RewritingArto Salomaa. 181-190 [doi]
- Reaction Systems with DurationRobert Brijder, Andrzej Ehrenfeucht, Grzegorz Rozenberg. 191-202 [doi]
- Nanomachine Computing by Quorum SensingJirí Wiedermann. 203-215 [doi]