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

• 2017
• 
  Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Sævar Örn Kjartansson:
  On the Complexity of Determinizing Monitors. CIAA 2017: 1-13
• 
  Martin Berglund, Brink van der Merwe, Bruce W. Watson, Nicolaas Weideman:
  On the Semantics of Atomic Subgroups in Practical Regular Expressions. CIAA 2017: 14-26
• 
  Henrik Björklund, Johanna Björklund, Petter Ericson:
  On the Regularity and Learnability of Ordered DAG Languages. CIAA 2017: 27-39
• 
  Henning Bordihn, Markus Holzer:
  On the Number of Active States in Deterministic and Nondeterministic Finite Automata. CIAA 2017: 40-51
• 
  Janusz A. Brzozowski, Corwin Sinnamon:
  Complexity of Proper Prefix-Convex Regular Languages. CIAA 2017: 52-63
• 
  Claudia Cauli, Nir Piterman:
  Equivalence of Probabilistic \mu -Calculus and p-Automata. CIAA 2017: 64-75
• 
  Véronique Cortier:
  Electronic Voting: How Logic Can Help. CIAA 2017: xi-xii
• 
  Louis-Marie Dando, Sylvain Lombardy:
  From Hadamard Expressions to Weighted Rotating Automata and Back. CIAA 2017: 163-174
• 
  Robert Ferens, Marek Szykula:
  Complexity of Bifix-Free Regular Languages. CIAA 2017: 76-88
• 
  Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
  Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems. CIAA 2017: 89-100
• 
  Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg:
  Stamina: Stabilisation Monoids in Automata Theory. CIAA 2017: 101-112
• 
  Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz:
  A Simple Method for Building Bimachines from Functional Finite-State Transducers. CIAA 2017: 113-125
• 
  Yo-Sub Han, Sang-Ki Ko:
  Alignment Distance of Regular Tree Languages. CIAA 2017: 126-137
• 
  Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
  Nondeterministic Complexity of Operations on Free and Convex Languages. CIAA 2017: 138-150
• 
  Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
  Transducing Reversibly with Finite State Machines. CIAA 2017: 151-162
• 
  Kim Guldstrand Larsen:
  Timed and Untimed Energy Games. CIAA 2017: xiii-xvi
• 
  Paolo Massazza:
  On the Conjecture ℒ_DFCM ⊊ RCM. CIAA 2017: 175-187
• 
  Damien Pous:
  CoInductive Automata Algorithms. CIAA 2017: xvii-xviii
• 
  Andrew Ryzhikov:
  Synchronization Problems in Automata Without Non-trivial Cycles. CIAA 2017: 188-200
• 
  Marek Szykula, John Wittnebel:
  Syntactic Complexity of Bifix-Free Languages. CIAA 2017: 201-212
• 
  Arnaud Carayol, Cyril Nicaud:
  Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings. Lecture Notes in Computer Science 10329, Springer 2017, ISBN 978-3-319-60133-5 [contents]