Abstract is missing.
- DNA self-assembly by hairpin (extended abstract)Victor Mitrana. 11-24
- Complexity classes in membrane computing: P-conjecture and related issuesAgustín Riscos-Núñez. 25-30
- Register machines over groupsArtiom Alhazov, Rudolf Freund, Sergiu Ivanov 0001. 31-46
- Extended tree expressions and their derivativesSamira Attou, Ludovic Mignot, Djelloul Ziadi. 47-62
- Synchronizing series-parallel automata with loopsJens Bruchertseifer, Henning Fernau. 63-78
- Turing machines with activations of transitionsRudolf Freund, Ludwig Staiger. 79-91
- A comment on strong language families and self-verifying complexity classesMarkus Holzer 0001, Sebastian Jakobi. 93-108
- Digging input-driven pushdown automataMartin Kutrib, Andreas Malcher. 109-124
- Computing by observing reductions in partial ordersPeter Leupold. 125-138
- Window size two suffices for deterministic monotone RWW-automataFrantisek Mráz, Friedrich Otto. 139-154
- On simple 5' → 3' sensing Watson-Crick finite-state transducersBenedek Nagy, Zita Kovács. 155-170
- Variational auto-encoders for generating feature-preserving automataIgor T. Podolak, Adam Roman, Arkadiusz Czekajski, Damian Lesniak, Bartosz Zielinski 0001. 171-185
- Accepting networks of evolutionary processors with resources restricted filtersBianca Truthe. 187-202