• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 23 matches

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