• 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 44 matches

• 2008
• 
  Ramón Alonso-Sanz, Larry Bull:
  Elementary coupled cellular automata with memory. Automata 2008: 72-99
• 
  Michael Duane Archer:
  A simple cellular automata model for FX market forecasting. Automata 2008: 557-572
• 
  Stefania Bandini, Sara Manzoni, Leonardo Vanneschi:
  Evolving robust cellular automata rules with genetic programming. Automata 2008: 542-556
• 
  Olga L. Bandman:
  Mapping physical phenomena onto CA-models. Automata 2008: 381-397
• 
  André Barbé:
  From cellular automata to a random artificial chemistry producing symmetric replicas. Automata 2008: 442-452
• 
  William R. Buckley:
  Signal crossing solutions in von Neumann self-replicating cellular automata. Automata 2008: 453-503
• 
  Larry Bull, Ramón Alonso-Sanz:
  On coupling random Boolean networks. Automata 2008: 292-305
• 
  David Dalrymple, Neil Gershenfeld, Kailiang Chen:
  Asynchronous logic automata. Automata 2008: 313-322
• 
  Patrick Ediger, Rolf Hoffmann:
  Optimizing the creature's rule for all-to-all communication. Automata 2008: 398-412
• 
  Martin Hülse, David Robert Wallace Barr, Piotr Dudek:
  Cellular automata and non-static image processing for embodied robot systems on a massively parallel processor array. Automata 2008: 504-513
• 
  Takahiro Ito, Shuichi Inokuchi, Yoshihiro Mizoguchi:
  An abstract collision system. Automata 2008: 339-355
• 
  Iztok Jeras:
  Solving cellular automata problems with SAGE/Python. Automata 2008: 417-424
• 
  Marcus Komann, Dietmar Fey:
  Solving the problem of enforced restriction to few states while evolving cellular automata. Automata 2008: 228-241
• 
  Martin Kutrib, Andreas Malcher:
  Real-time reversible language recognition by cellular automata. Automata 2008: 208-221
• 
  Anna T. Lawniczak, Bruno N. Di Stefano:
  Development of CA model of highway traffic. Automata 2008: 527-541
• 
  Anna T. Lawniczak, Hao Wu, Bruno N. Di Stefano:
  DDoS attack detection using entropy of packet traffic in CA like data communication network model. Automata 2008: 573-585
• 
  Jia Lee, Ferdinand Peper:
  On Brownian cellular automata. Automata 2008: 278-291
• 
  Ville Lukkarila:
  On undecidability of sensitivity of reversible cellular automata. Automata 2008: 100-105
• 
  Luidnel Maignan, Frédéric Gruau:
  A 1D cellular automaton that moves particles until regular spatial placement. Automata 2008: 323-338
• 
  Danuta Makowiec:
  On modeling of the heart pacemaker by cellular automata - topology issue. Automata 2008: 586-600
• 
  Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
  Recent results on iterative arrays with small space bounds. Automata 2008: 222-227
• 
  Maurice Margenstern, Yu Song:
  A new universal cellular automaton on the pentagrid. Automata 2008: 36-54
• 
  Alexsandro Souza Mariano, Gina M. B. Oliveira:
  Evolving one-dimensional radius-2 cellular automata rules for the synchronization task. Automata 2008: 514-526
• 
  Genaro Juárez Martínez, Andrew Adamatzky, Harold V. McIntosh, Benjamin de Lacy Costello:
  Computation by competing patterns: Life rule B2/S2345678. Automata 2008: 356-367
• 
  Mitsuru Matsushima, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita:
  A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life. Automata 2008: 413-416
• 
  Juan Carlos Seck Tuoh Mora, Manuel González Hernández, Harold V. McIntosh, Sergio V. Chapa Vergara:
  Construction of reversible cellular automata by amalgamations and permutations of states. Automata 2008: 114-125
• 
  Kenichi Morita:
  A 24-state universal one-dimensional reversible cellular automaton. Automata 2008: 106-113
• 
  Hidenosuke Nishio, Thomas Worsch:
  Changing the neighborhood of CA: local structure, equivalence and reversibility. Automata 2008: 270-277
• 
  Masaya Nohmi:
  Analysis of five-cell neighborhood linear cellular automaton. Automata 2008: 242-252
• 
  Fumio Ohi:
  Chaotic properties of elementary cellular automaton rule 168 of Wolfram class I. Automata 2008: 196-207

skipping 14 more matches