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

• 2023
• 
  Jean Weight, Trienko L. Grobler, Lynette van Zijl, Carlyle Stewart:
  A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words. DCFS 2023: 181-196
• 2021
• 
  Anna E. Frid, Enzo Laborde, Jarkko Peltomäki:
  On prefix palindromic length of automatic words. Theor. Comput. Sci. 891: 13-23 (2021)
• 2019
• 
  Antonio Boccuto, Arturo Carpi:
  On the length of uncompletable words in unambiguous automata. RAIRO Theor. Informatics Appl. 53(3-4): 115-123 (2019)
• 
  Petr Ambroz, Ondrej Kadlec, Zuzana Masáková, Edita Pelantová:
  Palindromic length of words and morphisms in class P. Theor. Comput. Sci. 780: 74-83 (2019)
• 2010
• 
  Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Jean-Luc Rémy:
  On the number of balanced words of given length and height over a two letter alphabet. Discret. Math. Theor. Comput. Sci. 12(3): 41-62 (2010)
• 2009
• 
  Alessandra Cherubini, Andrzej Kisielewicz, Brunetto Piochi:
  On the length of shortest 2-collapsing words. Discret. Math. Theor. Comput. Sci. 11(1): 33-44 (2009)
• 
  Jacques Vergne:
  The chunk as the period of the functions length and frequency of words on the syntagmatic axis. IWPT 2009: 202-205
• 2004
• 
  Evan M. Bullock:
  Improved Bounds on the Length of Maximal Abelian Square-free Words. Electron. J. Comb. 11(1) (2004)
• 2001
• 
  A. D. Korshunov:
  On the asymptotics of the number of binary words with a given length of a maximal series. Discret. Appl. Math. 114(1-3): 171-201 (2001)
• 2000
• 
  Lucian Ilie:
  On lengths of words in context-free languages. Theor. Comput. Sci. 242(1-2): 327-359 (2000)
• 1999
• 
  Solomon Marcus:
  On the Length of Words. Jewels are Forever 1999: 194-203
• 1996
• 
  Ioan Tomescu:
  On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet. Theor. Comput. Sci. 164(1&2): 277-285 (1996)
• 1989
• 
  William D. Weakley:
  On the number of C^infinity-words of each length. J. Comb. Theory A 51(1): 55-62 (1989)