|
|
Conferences in DBLP
- Andrew Adamatzky
Encapsulating Reaction-Diffusion Computers. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:1-11 [Conf]
- Olivier Bournez, Emmanuel Hainry
On the Computational Capabilities of Several Models. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:12-23 [Conf]
- Mark Burgin
Universality, Reducibility, and Completeness. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:24-38 [Conf]
- Manuel Lameiras Campagnolo, Kerry Ojakian
Using Approximation to Relate Computational Classes over the Reals. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:39-61 [Conf]
- Joel David Hamkins
A Survey of Infinite Time Turing Machines. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:62-71 [Conf]
- Jarkko Kari
The Tiling Problem Revisited (Extended Abstract). [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:72-79 [Conf]
- Pascal Koiran
Decision Versus Evaluation in Algebraic Complexity. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:80-89 [Conf]
- Kenichi Morita, Yoshikazu Yamaguchi
A Universal Reversible Turing Machine. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:90-98 [Conf]
- K. G. Subramanian
P Systems and Picture Languages. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:99-109 [Conf]
- Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan
Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:110-121 [Conf]
- Artiom Alhazov, Mario J. Pérez-Jiménez
Uniform Solution of. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:122-133 [Conf]
- Dorothea Baumeister, Jörg Rothe
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:134-145 [Conf]
- Tommaso Bolognesi
Planar Trivalent Network Computation. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:146-157 [Conf]
- Jürgen Dassow, Bianca Truthe
On the Power of Networks of Evolutionary Processors. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:158-169 [Conf]
- Liesbeth De Mol
Study of Limits of Solvability in Tag Systems. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:170-181 [Conf]
- John Fisher, Marc Bezem
Query Completeness of Skolem Machine Computations. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:182-192 [Conf]
- Hermann Gruber, Markus Holzer, Martin Kutrib
More on the Size of Higman-Haines Sets: Effective Constructions. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:193-204 [Conf]
- Artiom Matveevici, Yurii Rogozhin, Sergey Verlan
Insertion-Deletion Systems with One-Sided Contexts. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:205-217 [Conf]
- Juan Castellanos, Florin Manea, Luis Fernando de Mingo López, Victor Mitrana
Accepting Networks of Splicing Processors with Filtered Connections. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:218-229 [Conf]
- Frantisek Mráz, Friedrich Otto, Martin Plátek
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:230-241 [Conf]
- Turlough Neary, Damien Woods
Four Small Universal Turing Machines. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:242-254 [Conf]
- Hidenosuke Nishio
Changing the Neighborhood of Cellular Automata. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:255-266 [Conf]
- Alexander Okhotin
A Simple P-Complete Problem and Its Representations by Language Equations. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:267-278 [Conf]
- Olivier Teytaud
Slightly Beyond Turing's Computability for Studying Genetic Programming. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:279-290 [Conf]
- Hiroshi Umeo, Takashi Yanagihara
A Smallest Five-State Solution to the Firing Squad Synchronization Problem. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:291-302 [Conf]
- Damien Woods, Turlough Neary
Small Semi-weakly Universal Turing Machines. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:303-315 [Conf]
- Jean-Baptiste Yunès
Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:316-324 [Conf]
|
