• 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

• 2000
• 
  Paolo Boldi, Sebastiano Vigna:
  The Turing closure of an Archimedean field. Theor. Comput. Sci. 231(2): 143-156 (2000)
• 
  Janusz A. Brzozowski, Radu Negulescu:
  Automata of Asynchronous Behaviors. Theor. Comput. Sci. 231(1): 113-128 (2000)
• 
  Pascal Caron:
  LANGAGE: A Maple Package for Automaton Characterization of Regular Languages. Theor. Comput. Sci. 231(1): 5-15 (2000)
• 
  Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori:
  On the universality of Post and splicing systems. Theor. Comput. Sci. 231(2): 157-170 (2000)
• 
  Claudio Ferretti, Giancarlo Mauri, Claudio Zandron:
  Nine test tubes generate any RE language. Theor. Comput. Sci. 231(2): 171-180 (2000)
• 
  Katsunobu Imai, Kenichi Morita:
  A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theor. Comput. Sci. 231(2): 181-191 (2000)
• 
  Lila Kari, Greg Gloor, Sheng Yu:
  Using DNA to solve the Bounded Post Correspondence Problem. Theor. Comput. Sci. 231(2): 193-203 (2000)
• 
  Helmut Lescow, Jens Vöge:
  Minimal Separating Sets for Acceptance Conditions in Muller Automata. Theor. Comput. Sci. 231(1): 47-57 (2000)
• 
  Arnaud Maes:
  More on morphisms and almost-periodicity. Theor. Comput. Sci. 231(2): 205-215 (2000)
• 
  Maurice Margenstern:
  Frontier between decidability and undecidability: a survey. Theor. Comput. Sci. 231(2): 217-251 (2000)
• 
  Denis Maurel:
  Pseudo-Minimal Transducer. Theor. Comput. Sci. 231(1): 129-139 (2000)
• 
  Christian Michaux, Christophe Troestler:
  Isomorphism theorem for BSS recursively enumerable sets over real closed fields. Theor. Comput. Sci. 231(2): 253-273 (2000)
• 
  Mehryar Mohri, Fernando C. N. Pereira, Michael Riley:
  The Design Principles of a Weighted Finite-State Transducer Library. Theor. Comput. Sci. 231(1): 17-32 (2000)
• 
  Jean-Luc Ponty:
  An Efficient Null-Free Procedure for Deciding Regular Language Membership. Theor. Comput. Sci. 231(1): 89-101 (2000)
• 
  Gheorghe Paun:
  DNA computing based on splicing: universality results. Theor. Comput. Sci. 231(2): 275-296 (2000)
• 
  Hiroshi Sakamoto, Daisuke Ikeda:
  Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231(2): 297-308 (2000)
• 
  Kai Salomaa, Xiuming Wu, Sheng Yu:
  Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. Theor. Comput. Sci. 231(1): 103-111 (2000)
• 
  Géraud Sénizergues:
  Complete formal systems for equivalence problems. Theor. Comput. Sci. 231(2): 309-334 (2000)
• 
  Max Silberztein:
  INTEX: An FST Toolbox. Theor. Comput. Sci. 231(1): 33-46 (2000)
• 
  A. N. Trahtman:
  Optimal Estimation on the Order of Local Testability of Finite Automata. Theor. Comput. Sci. 231(1): 59-74 (2000)
• 
  Djelloul Ziadi:
  Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems. Theor. Comput. Sci. 231(1): 75-87 (2000)