• 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

• 2012
• 
  Paul C. Bell, Igor Potapov:
  On the Computational Complexity of Matrix Semigroup Problems. Fundam. Informaticae 116(1-4): 1-13 (2012)
• 
  Robert Brijder, Hendrik Jan Hoogeboom:
  Binary Symmetric Matrix Inversion Through Local Complementation. Fundam. Informaticae 116(1-4): 15-23 (2012)
• 
  Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni:
  Some Characterizations of Sturmian Words in Terms of the Lexicographic Order. Fundam. Informaticae 116(1-4): 25-33 (2012)
• 
  Giusi Castiglione, Antonio Restivo:
  On the Shuffle of Star-Free Languages. Fundam. Informaticae 116(1-4): 35-44 (2012)
• 
  Christian Choffrut:
  A Note on the Logical Definability of Rational Trace Languages. Fundam. Informaticae 116(1-4): 45-50 (2012)
• 
  Elena Czeizler, Andrzej Mizera, Ion Petre:
  A Boolean Approach for Disentangling the Roles of Submodules to the Global Properties of a Biomodel. Fundam. Informaticae 116(1-4): 51-63 (2012)
• 
  Volker Diekert, Manfred Kufleitner, Benjamin Steinberg:
  The Krohn-Rhodes Theorem and Local Divisors. Fundam. Informaticae 116(1-4): 65-77 (2012)
• 
  Yuan Gao, Sheng Yu:
  State Complexity of Combined Operations with Union, Intersection, Star and Reversal. Fundam. Informaticae 116(1-4): 79-92 (2012)
• 
  Nikita Gogin, Mika Hirvensalo:
  Recurrent Construction of MacWilliams and Chebyshev Matrices. Fundam. Informaticae 116(1-4): 93-110 (2012)
• 
  Jurriaan Hage:
  Subgroup Switching of Skew Gain Graphs. Fundam. Informaticae 116(1-4): 111-122 (2012)
• 
  Vesa Halava, Juhani Karhumäki, Dirk Nowotka, Grzegorz Rozenberg:
  Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju. Fundam. Informaticae 116(1-4) (2012)
• 
  Juha Honkala:
  A Characterization of Regular Languages as Equality Sets of HDT0L Sequences. Fundam. Informaticae 116(1-4): 123-128 (2012)
• 
  Oscar H. Ibarra, Ömer Egecioglu:
  A Survey of Results on Stateless Multicounter Automata. Fundam. Informaticae 116(1-4): 129-140 (2012)
• 
  Jarkko Kari, Bastien Le Gloannec:
  Modified Traffic Cellular Automaton for the Density Classification Task. Fundam. Informaticae 116(1-4): 141-156 (2012)
• 
  Tomi Kärki:
  Repetition-freeness with Cyclic Relations and Chain Relations. Fundam. Informaticae 116(1-4): 157-174 (2012)
• 
  Anne Lacroix, Narad Rampersad, Michel Rigo, Élise Vandomme:
  Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. Fundam. Informaticae 116(1-4): 175-187 (2012)
• 
  Michel Latteux, Yves Roos:
  On One-Rule Grid Semi-Thue Systems. Fundam. Informaticae 116(1-4): 189-204 (2012)
• 
  Alexander Okhotin:
  Language Equations with Symmetric Difference. Fundam. Informaticae 116(1-4): 205-222 (2012)
• 
  Narad Rampersad, Jeffrey O. Shallit, Zhi Xu:
  The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages. Fundam. Informaticae 116(1-4): 223-236 (2012)
• 
  Arto Salomaa:
  Mirror Images and Schemes for the Maximal Complexity of Nondeterminism. Fundam. Informaticae 116(1-4): 237-249 (2012)
• 
  Patrice Séébold:
  Length-k-overlap-free Binary Infinite Words. Fundam. Informaticae 116(1-4): 251-263 (2012)