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

• 2006
• 
  Parosh Aziz Abdulla, Lisa Kaati, Johanna Högberg:
  Bisimulation Minimization of Tree Automata. CIAA 2006: 173-185
• 
  Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo:
  Finding Common Motifs with Gaps Using Finite Automata. CIAA 2006: 69-77
• 
  Manuel Baclet, Claire Pagetti:
  Around Hopcroft's Algorithm. CIAA 2006: 114-125
• 
  Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
  Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. CIAA 2006: 90-101
• 
  Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini:
  Symbolic Implementation of Alternating Automata. CIAA 2006: 208-218
• 
  Guillaume Bonfante, Joseph Le Roux, Guy Perrier:
  Lexical Disambiguation with Polarities and Automata. CIAA 2006: 283-284
• 
  Henning Bordihn, Markus Holzer, Martin Kutrib:
  Hybrid Extended Finite Automata. CIAA 2006: 34-45
• 
  Yung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng:
  On-the-Fly Branching Bisimulation Minimization for Compositional Analysis. CIAA 2006: 219-229
• 
  Matthieu Constant, Denis Maurel:
  Compiling Linguistic Constraints into Finite State Automata. CIAA 2006: 242-252
• 
  Corinna Cortes, Mehryar Mohri, Ashish Rastogi:
  On the Computation of Some Standard Distances Between Probabilistic Automata. CIAA 2006: 137-149
• 
  Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi:
  Factor Oracles. CIAA 2006: 78-89
• 
  Tim Fernando:
  Finite-State Temporal Projection. CIAA 2006: 230-241
• 
  José Fortes Gálvez, Sylvain Schmitz, Jacques Farré:
  Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time. CIAA 2006: 253-264
• 
  Mathieu Giraud, Philippe Veber, Dominique Lavenier:
  Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton. CIAA 2006: 23-33
• 
  Jens Glöckler:
  Forgetting Automata and Unary Languages. CIAA 2006: 186-197
• 
  Heikki Hyyrö:
  Tighter Packed Bit-Parallel NFA for Approximate String Matching. CIAA 2006: 287-289
• 
  Hing Leung:
  Structurally Unambiguous Finite Automata. CIAA 2006: 198-207
• 
  Ming Li:
  Information Distance and Its Applications. CIAA 2006: 1-9
• 
  Michael Luttenberger:
  Reachability Analysis of Procedural Programs with Affine Integer Arithmetic. CIAA 2006: 281-282
• 
  Andreas Maletti:
  Does o-Substitution Preserve Recognizability? CIAA 2006: 150-161
• 
  Jonathan May, Kevin Knight:
  Tiburon: A Weighted Tree Automata Toolkit. CIAA 2006: 102-113
• 
  Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek:
  Correctness Preservation and Complexity of Simple RL-Automata. CIAA 2006: 162-172
• 
  Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe:
  Multi-tape Automata with Symbol Classes. CIAA 2006: 126-136
• 
  Ruhsan Onder, Zeki Bayram:
  XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof. CIAA 2006: 275-276
• 
  Manuel Vazquez de Parga, Pedro García, José Ruiz:
  A Family of Algorithms for Non Deterministic Regular Languages Inference. CIAA 2006: 265-274
• 
  Suman Roy, Bhaskar Chakraborty:
  A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems. CIAA 2006: 277-278
• 
  Grzegorz Rozenberg:
  Theory Inspired by Gene Assembly in Ciliates. CIAA 2006: 10
• 
  Martin Simunek, Borivoj Melichar:
  Borders and Finite Automata. CIAA 2006: 58-68
• 
  Adrian D. Thurston:
  Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression. CIAA 2006: 285-286
• 
  German Tischler:
  Refinement of Near Random Access Video Coding with Weighted Finite Automata. CIAA 2006: 46-57

skipping 3 more matches