default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. MCU 2001: Chisinau, Moldova
- Maurice Margenstern, Yurii Rogozhin:
Machines, Computations, and Universality, Third International Conference, MCU 2001, Chisinau, Moldova, May 23-27, 2001, Proceedings. Lecture Notes in Computer Science 2055, Springer 2001, ISBN 3-540-42121-1
Invited Lectures
- Claudio Baiocchi:
Three Small Universal Turing Machines. 1-10 - Asa Ben-Hur
, Hava T. Siegelmann:
Computation in Gene Networks. 11-24 - Jozef Gruska, Hiroshi Imai:
Power, Puzzles and Properties of Entanglement. 25-68 - Juhani Karhumäki:
Combinatorial and Computational Problems on Finite Sets of Words. 69-81 - Carlos Martín-Vide, Gheorghe Paun:
Computing with Membranes (P Systems): Universality Results. 82-101 - Kenichi Morita:
A Simple Universal Logic Element and Cellular Automata for Reversible Computing. 102-113 - Géraud Sénizergues:
Some Applications of the Decidability of DPDA's Equivalence. 114-132 - Vladimir A. Zakharov:
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases. 133-152 - Claudio Zandron, Claudio Ferretti, Giancarlo Mauri:
Two Normal Forms for Rewriting P Systems. 153-164
Technical Contributions
- Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu:
On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations. 165-176 - Didier Caucal:
On the Transition Graphs of Turing Machines. 177-189 - Gabriel Ciobanu, Mihai Rotaru:
JC-Nets. 190-201 - Henning Fernau:
Nonterminal Complexity of Programmed Grammars. 202-213 - Rudolf Freund, Gheorghe Paun:
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars. 214-225 - Pierluigi Frisco:
A Direct Construction of a Universal Extended H System. 226-239 - Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai:
Speeding-Up Cellular Automata by Alternations. 240-251 - Martin Kutrib:
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. 252-263 - Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints. 264-275 - Madhu Mutyam, Kamala Krithivasan:
P Systems with Membrane Creation: Universality and Efficiency. 276-287 - Thomas J. Naughton, Damien Woods:
On the Computational Power of a Continuous-Space Optical Model of Computation. 288-299 - Zenon Sadowski:
On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT). 300-307 - Petr Sosík:
D0L System + Watson-Crick Complementarity = Universal Computation. 308-320
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
