• 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

• 1999
• 
  Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi:
  Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers. Lecture Notes in Computer Science 1660, Springer 1999, ISBN 3-540-66652-4 [contents]
• 1998
• 
  Jürgen Albert, Dora Giammarresi, Derick Wood:
  Extended Context-Free Grammars and Normal Form Algorithms. Workshop on Implementing Automata 1998: 1-12
• 
  Xavier Augros:
  Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set. Workshop on Implementing Automata 1998: 220-225
• 
  Marie-Chantal Beaulieu, Anne Bergeron:
  Automata and Computational Probabilities. Workshop on Implementing Automata 1998: 164-177
• 
  Norbert Blum:
  On Parsing LL-Languages. Workshop on Implementing Automata 1998: 13-21
• 
  Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
  Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata 1998: 43-56
• 
  Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty:
  Determinization of Glushkov Automata. Workshop on Implementing Automata 1998: 57-68
• 
  Gérard Duchamp, Marianne Flouret, Éric Laugerotte:
  Operations over Automata with Multiplicities. Workshop on Implementing Automata 1998: 183-191
• 
  Heiko Goeman:
  On Parsing and Condensing Substrings of LR Languages in Linear Time. Workshop on Implementing Automata 1998: 22-42
• 
  Jan Holub, Borivoj Melichar:
  Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. Workshop on Implementing Automata 1998: 92-99
• 
  Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu:
  Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. Workshop on Implementing Automata 1998: 69-81
• 
  Ricardo Ueda Karpischek:
  Paging Automata. Workshop on Implementing Automata 1998: 192-198
• 
  Dominique L'Her, Philippe Le Parc, Lionel Marcé:
  Proving Sequential Function Chart Programs Using Automata. Workshop on Implementing Automata 1998: 149-163
• 
  Denis Maurel, Brigitte Le Pévédic, Olivier Rousseau:
  The Syntactic Prediction with Token Automata: Application to HandiAS System. Workshop on Implementing Automata 1998: 100-109
• 
  Jean-Francis Michon, Jean-Marc Champarnaud:
  Automata and Binary Decision Diagrams. Workshop on Implementing Automata 1998: 178-182
• 
  Matti Nykänen:
  Using Acceptors as Transducers. Workshop on Implementing Automata 1998: 133-148
• 
  Sandro Pedrazzini:
  The Finite State Automata's Design Patterns. Workshop on Implementing Automata 1998: 213-219
• 
  Thierry Poibeau:
  Bi-directional Automata to Extract Complex Phrases from Texts. Workshop on Implementing Automata 1998: 110-120
• 
  Max Silberztein:
  INTEX 4.1 for Windows: A Walkthrough. Workshop on Implementing Automata 1998: 230-243
• 
  Zdenek Tronícek:
  Operations on DASG. Workshop on Implementing Automata 1998: 82-91
• 
  Are Uppman, Jean-Marc Champarnaud:
  Autographe: A Graphical Version of Automate. Workshop on Implementing Automata 1998: 226-229
• 
  Yuri Velinov:
  On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment. Workshop on Implementing Automata 1998: 199-212
• 
  Bruce W. Watson:
  A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs. Workshop on Implementing Automata 1998: 121-132