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

• 2002
• 
  Paolo Baldan, Andrea Corradini, Ugo Montanari:
  Bisimulation Equivalences for Graph Grammars. Formal and Natural Computing 2002: 158-190
• 
  Maurice H. ter Beek, H. C. M. Kleijn:
  Petri Net Control for Grammar Systems. Formal and Natural Computing 2002: 220-243
• 
  Jean Berstel, Luc Boasson:
  Balanced Grammars and Their Languages. Formal and Natural Computing 2002: 3-25
• 
  Paolo Bottoni, Anna Labella, Carlos Martín-Vide, Gheorghe Paun:
  Rewriting P Systems with Conditional Communication. Formal and Natural Computing 2002: 325-353
• 
  Volker Diekert, Paul Gastin:
  Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. Formal and Natural Computing 2002: 26-38
• 
  Hartmut Ehrig, Kathrin Hoffmann, Julia Padberg, Paolo Baldan, Reiko Heckel:
  High-Level Net Processes. Formal and Natural Computing 2002: 191-219
• 
  Joost Engelfriet:
  The Delta Operation: From Strings to Trees to Strings. Formal and Natural Computing 2002: 39-56
• 
  Gregor Engels, Luuk Groenewegen:
  Towards Team-Automata-Driven Object-Oriented Collaborative Work. Formal and Natural Computing 2002: 257-276
• 
  Javier Esparza:
  Grammars as Processes. Formal and Natural Computing 2002: 277-297
• 
  Vesa Halava, Tero Harju:
  Infinite Solutions of Marked Post Correspondence Problem. Formal and Natural Computing 2002: 57-68
• 
  Tom Head:
  An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation. Formal and Natural Computing 2002: 354-360
• 
  Hendrik Jan Hoogeboom, Nike van Vugt:
  Upper Bounds for Restricted Splicing. Formal and Natural Computing 2002: 361-375
• 
  Dirk Janssens:
  Local Action Systems and DPO Graph Transformation. Formal and Natural Computing 2002: 138-157
• 
  Juhani Karhumäki, Ion Petre:
  The Branching Point Approach to Conway's Problem. Formal and Natural Computing 2002: 69-76
• 
  Lila Kari, Rob Kitto, Gabriel Thierrin:
  Codes, Involutions, and DNA Encodings. Formal and Natural Computing 2002: 376-393
• 
  Hans-Jörg Kreowski:
  A Sight-seeing Tour of the Computational Landscape of Graph Transformation. Formal and Natural Computing 2002: 119-137
• 
  Aldo de Luca:
  A Survey of Some Quantitative Approaches to the Notion of Information. Formal and Natural Computing 2002: 77-95
• 
  Alexandru Mateescu, Arto Salomaa:
  Nondeterministic Trajectories. Formal and Natural Computing 2002: 96-106
• 
  Mogens Nielsen, Frank D. Valencia:
  Temporal Concurrent Constraint Programming: Applications and Behavior. Formal and Natural Computing 2002: 298-324
• 
  David M. Prescott:
  DNA Manipulations in Ciliates. Formal and Natural Computing 2002: 394-417
• 
  Antonio Restivo, Sergio Salemi:
  Binary Patterns in Infinite Binary Words. Formal and Natural Computing 2002: 107-118
• 
  P. S. Thiagarajan:
  Regular Event Structures and Finite Petri Nets: A Conjecture. Formal and Natural Computing 2002: 244-256
• 
  Takashi Yokomori, Yasubumi Sakakibara, Satoshi Kobayashi:
  A Magic Pot : Self-assembly Computation Revisited. Formal and Natural Computing 2002: 418-430
• 
  Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto Salomaa:
  Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]. Lecture Notes in Computer Science 2300, Springer 2002, ISBN 3-540-43190-X [contents]