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

• 2017
• 
  Marcella Anselmo, Dora Giammarresi, Maria Madonia:
  Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties. AUTOMATA 2017: 19-31
• 
  Antonio Bernini:
  Restricted Binary Strings and Generalized Fibonacci Numbers. AUTOMATA 2017: 32-43
• 
  Alonso Castillo-Ramirez, Maximilien Gadouleau:
  Von Neumann Regular Cellular Automata. AUTOMATA 2017: 44-55
• 
  Lapo Cioni, Luca Ferrari:
  Enumerative Results on the Schröder Pattern Poset. AUTOMATA 2017: 56-67
• 
  Sylvain Contassot-Vivier, Jean-François Couchot:
  Canonical Form of Gray Codes in N-cubes. AUTOMATA 2017: 68-80
• 
  Nazim Fatès:
  Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules. AUTOMATA 2017: 97-108
• 
  Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger:
  On the Computational Complexity of the Freezing Non-strict Majority Automata. AUTOMATA 2017: 109-119
• 
  Pierre Guillon, Ville Salo:
  Distortion in One-Head Machines and Cellular Automata. AUTOMATA 2017: 120-138
• 
  Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
  Fast One-Way Cellular Automata with Reversible Mealy Cells. AUTOMATA 2017: 139-150
• 
  Pietro Di Lena:
  Equicontinuity and Sensitivity of Nondeterministic Cellular Automata. AUTOMATA 2017: 81-96
• 
  Luca Mariot, Enrico Formenti, Alberto Leporati:
  Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata. AUTOMATA 2017: 151-164
• 
  Gaétan Richard:
  Filling Curves Constructed in Cellular Automata with Aperiodic Tiling. AUTOMATA 2017: 165-175
• 
  Ville Salo:
  Strict Asymptotic Nilpotency in Cellular Automata. AUTOMATA 2017: 3-15
• 
  Véronique Terrier:
  Some Computational Limits of Trellis Automata. AUTOMATA 2017: 176-186
• 
  Tatsuya Yamashita, Teijiro Isokawa, Ferdinand Peper, Ibuki Kawamata, Masami Hagiya:
  Turing-Completeness of Asynchronous Non-camouflage Cellular Automata. AUTOMATA 2017: 187-199
• 
  Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
  Cellular Automata and Discrete Complex Systems - 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings. Lecture Notes in Computer Science 10248, Springer 2017, ISBN 978-3-319-58630-4 [contents]