Abstract is missing.
- Decidability Problems for Self-induced Systems Generated by a SubstitutionTimo Jolivet, Anne Siegel. 3-16 [doi]
- Towards Formal Verification of Computations and Hypercomputations in Relativistic PhysicsMike Stannett. 17-27 [doi]
- A Connection Between Red-Green Turing Machines and Watson-Crick T0L SystemsErzsébet Csuhaj-Varjú, Rudolf Freund, György Vaszil. 31-44 [doi]
- Tight Bounds for Cut-Operations on Deterministic Finite AutomataFrank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe. 45-60 [doi]
- Non-isometric Contextual Array Grammars with Regular Control and Local SelectorsHenning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian. 61-78 [doi]
- Universality of Graph-controlled Leftist Insertion-deletion Systems with Two StatesSergiu Ivanov 0001, Sergey Verlan. 79-93 [doi]
- Tinput-Driven Pushdown AutomataMartin Kutrib, Andreas Malcher, Matthias Wendlandt. 94-112 [doi]
- Reversible Limited AutomataMartin Kutrib, Matthias Wendlandt. 113-128 [doi]
- An Intrinsically Universal Family of Causal Graph DynamicsSimon Martiel, Bruno Martin. 129-148 [doi]
- The Simulation Powers and Limitations of Hierarchical Self-Assembly SystemsJacob Hendricks, Matthew J. Patitz, Trent A. Rogers. 149-163 [doi]
- A Characterization of NP Within Interval-Valued ComputingBenedek Nagy, Sándor Vályi. 164-179 [doi]
- Universality in Infinite Petri NetsDmitry A. Zaitsev. 180-197 [doi]