| 2004 | Completing a Code in a Regular Submonoid of the Free Monoid. | Jean Nraud |
| 2004 | The Computational Power of Continuous Dynamic Systems. | Jerzy Mycka, Jos Flix Costa |
| 2004 | Classification and Universality of Reversible Logic Elements with One-Bit Memory. | Kenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato |
| 2004 | Solving 3CNF-SAT and HPP in Linear Time Using WWW. | Florin Manea, Carlos Martn-Vide, Victor Mitrana |
| 2004 | Universal Families of Reversible P Systems. | Alberto Leporati, Claudio Zandron, Giancarlo Mauri |
| 2004 | Finite Sets of Words and Computing. | Juhani Karhumki |
| 2004 | Hierarchies of DLOGTIME-Uniform Circuits. | Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu |
| 2004 | Register Complexity of LOOP-, WHILE-, and GOTO-Programs. | Markus Holzer, Martin Kutrib |
| 2004 | Sequential P Systems with Unit Rules and Energy Assigned to Membranes. | Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron |
| 2004 | Is Bosco's Rule Universal? | Kellie Michele Evans |
| 2004 | Abstract Geometrical Computation for Black Hole Computation. | Jrme Durand-Lose |
| 2004 | Computational Universality in Symbolic Dynamical Systems. | Jean-Charles Delvenne, Petr Kurka, Vincent D. Blondel |
| 2004 | On the Complexity of Universal Programs. | Alain Colmerauer |
| 2004 | Evolution and Observation: A Non-standard Way to Accept Formal Languages. | Matteo Cavaliere, Peter Leupold |
| 2004 | Subshifts Behavior of Cellular Automata. Topological Properties and Related Languages. | Gianpiero Cattaneo, Alberto Dennunzio |
| 2004 | Ordering and Convex Polyominoes. | Giusi Castiglione, Antonio Restivo |
| 2004 | Algorithmic Randomness, Quantum Physics, and Incompleteness. | Cristian Calude |
| 2004 | Real Recursive Functions and Real Extensions of Recursive Functions. | Olivier Bournez, Emmanuel Hainry |
| 2004 | Computing with a Distributed Reaction-Diffusion Model. | Stefania Bandini, Giancarlo Mauri, Giulio Pavesi, Carla Simone |
| 2004 | Computational Completeness of P Systems with Active Membranes and Two Polarizations. | Artiom Alhazov, Rudolf Freund, Gheorghe Paun |
| 2001 | Two Normal Forms for Rewriting P Systems. | Claudio Zandron, Claudio Ferretti, Giancarlo Mauri |
| 2001 | The Equivalence Problem for Computational Models: Decidable and Undecidable Cases. | Vladimir A. Zakharov |
| 2001 | Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints. | Salvatore La Torre, Margherita Napoli, Mimmo Parente |
| 2001 | D0L System + Watson-Crick Complementarity = Universal Computation. | Petr Sosk |
| 2001 | Some Applications of the Decidability of DPDA's Equivalence. | Graud Snizergues |