Conferences in DBLP

Machines, Computations, and Universality (MCU) (mcu)
2001 (conf/mcu/2001)

1. Claudio Baiocchi
   Three Small Universal Turing Machines. [Citation Graph (0, 0)][DBLP]
   MCU, 2001, pp:1-10 [Conf]
   
2. Asa Ben-Hur, Hava T. Siegelmann
   Computation in Gene Networks. [Citation Graph (0, 0)][DBLP]
   MCU, 2001, pp:11-24 [Conf]
   
3. Jozef Gruska, Hiroshi Imai
   Power, Puzzles and Properties of Entanglement. [Citation Graph (0, 0)][DBLP]
   MCU, 2001, pp:25-68 [Conf]
   
4. Juhani Karhumäki
   Combinatorial and Computational Problems on Finite Sets of Words. [Citation Graph (0, 0)][DBLP]
   MCU, 2001, pp:69-81 [Conf]
   
5. Carlos Martín-Vide, Gheorghe Paun
   Computing with Membranes (P Systems): Universality Results. [Citation Graph (0, 0)][DBLP]
   MCU, 2001, pp:82-101 [Conf]
   
6. Kenichi Morita
   A Simple Universal Logic Element and Cellular Automata for Reversible Computing. [Citation Graph (0, 0)][DBLP]
   MCU, 2001, pp:102-113 [Conf]
   
7. Géraud Sénizergues
   Some Applications of the Decidability of DPDA's Equivalence. [Citation Graph (0, 0)][DBLP]
   MCU, 2001, pp:114-132 [Conf]
   
8. Vladimir A. Zakharov
   The Equivalence Problem for Computational Models: Decidable and Undecidable Cases. [Citation Graph (0, 0)][DBLP]
   MCU, 2001, pp:133-152 [Conf]
   
9. Claudio Zandron, Claudio Ferretti, Giancarlo Mauri
   Two Normal Forms for Rewriting P Systems. [Citation Graph (0, 0)][DBLP]
   MCU, 2001, pp:153-164 [Conf]
   
10. Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu
    On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:165-176 [Conf]
    
11. Didier Caucal
    On the Transition Graphs of Turing Machines. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:177-189 [Conf]
    
12. Gabriel Ciobanu, Mihai Rotaru
    JC-Nets. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:190-201 [Conf]
    
13. Henning Fernau
    Nonterminal Complexity of Programmed Grammars. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:202-213 [Conf]
    
14. Rudolf Freund, Gheorghe Paun
    On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:214-225 [Conf]
    
15. Pierluigi Frisco
    A Direct Construction of a Universal Extended H System. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:226-239 [Conf]
    
16. Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
    Speeding-Up Cellular Automata by Alternations. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:240-251 [Conf]
    
17. Martin Kutrib
    Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:252-263 [Conf]
    
18. Salvatore La Torre, Margherita Napoli, Mimmo Parente
    Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:264-275 [Conf]
    
19. Madhu Mutyam, Kamala Krithivasan
    P Systems with Membrane Creation: Universality and Efficiency. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:276-287 [Conf]
    
20. Thomas J. Naughton, Damien Woods
    On the Computational Power of a Continuous-Space Optical Model of Computation. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:288-299 [Conf]
    
21. Zenon Sadowski
    On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT). [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:300-307 [Conf]
    
22. Petr Sosík
    D0L System + Watson-Crick Complementarity = Universal Computation. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:308-320 [Conf]