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

• 2012
• 
  Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, César Rodríguez, Stefan Schwoon:
  Efficient unfolding of contextual Petri nets. Theor. Comput. Sci. 449: 2-22 (2012)
• 
  Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
  The size-cost of Boolean operations on constant height deterministic pushdown automata. Theor. Comput. Sci. 449: 23-36 (2012)
• 
  Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
  Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. Theor. Comput. Sci. 449: 37-53 (2012)
• 
  Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne:
  Geometrical regular languages and linear Diophantine equations: The strongly connected case. Theor. Comput. Sci. 449: 54-63 (2012)
• 
  Jürgen Dassow, Florin Manea, Bianca Truthe:
  On external contextual grammars with subregular selection languages. Theor. Comput. Sci. 449: 64-73 (2012)
• 
  Markus Holzer, Martin Kutrib, Giovanni Pighizzini:
  Preface. Theor. Comput. Sci. 449: 1 (2012)
• 
  Oscar H. Ibarra, Nicholas Q. Trân:
  On synchronized multi-tape and multi-head automata. Theor. Comput. Sci. 449: 74-84 (2012)
• 
  Galina Jirásková, Tomás Masopust:
  On a structural property in the state complexity of projected regular languages. Theor. Comput. Sci. 449: 93-105 (2012)
• 
  Galina Jirásková, Juraj Sebej:
  Reversal of binary regular languages. Theor. Comput. Sci. 449: 85-92 (2012)
• 
  Michal Kunc, Alexander Okhotin:
  State complexity of operations on two-way finite automata over a unary alphabet. Theor. Comput. Sci. 449: 106-118 (2012)
• 
  Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
  Descriptional complexity of two-way pushdown automata with restricted head reversals. Theor. Comput. Sci. 449: 119-133 (2012)
• 
  Sherzod Turaev, Jürgen Dassow, Florin Manea, Mohd Hasan Selamat:
  Language classes generated by tree controlled grammars with bounded nonterminal complexity. Theor. Comput. Sci. 449: 134-144 (2012)