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

• 2020
• 
  Markus Holzer, Martin Kutrib:
  Automata That May Change Their Mind. J. Autom. Lang. Comb. 25(2-3): 115-140 (2020)
• 
  Ondrej Klíma, Libor Polák:
  Forbidden Patterns for Ordered Automata. J. Autom. Lang. Comb. 25(2-3): 141-169 (2020)
• 
  Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour, Mark Shattuck:
  Counting Permutations by the Number of Vertical Edges in Their Bargraphs. J. Autom. Lang. Comb. 25(4): 279-290 (2020)
• 
  Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
  A Combinatorial Approach for the State Complexity of the Shuffle Product. J. Autom. Lang. Comb. 25(4): 291-320 (2020)
• 
  Jürgen Dassow:
  Lindenmayer Systems with Control by Ideals and Codes. J. Autom. Lang. Comb. 25(1): 3-20 (2020)
• 
  Jürgen Dassow, Bianca Truthe:
  Generating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters. J. Autom. Lang. Comb. 25(2-3): 83-113 (2020)
• 
  Sigrid Ewert, Daria Sergeevna Tkachova:
  Necessary Conditions for Subclasses of Random Context Galleries. J. Autom. Lang. Comb. 25(1): 21-35 (2020)
• 
  Michal Hospodár, Galina Jirásková, Giovanni Pighizzini:
  Preface. J. Autom. Lang. Comb. 25(2-3): 81-82 (2020)
• 
  Radim Kocman, Zbynek Krivka, Alexander Meduna:
  General CD Grammar Systems and Their Simplification. J. Autom. Lang. Comb. 25(1): 37-54 (2020)
• 
  Stavros Konstantinidis:
  Every Regular Bifix Code is a Finite Union of Regular Infix Codes. J. Autom. Lang. Comb. 25(1): 55-59 (2020)
• 
  Martin Kutrib, Friedrich Otto:
  On Two-Sided Locally Testable Languages. J. Autom. Lang. Comb. 25(2-3): 171-199 (2020)
• 
  Kalpana Mahalingam, Prithwineel Paul:
  On Szilard Languages of InsDel Systems. J. Autom. Lang. Comb. 25(4): 321-348 (2020)
• 
  Toufik Mansour, Matthias Schork, Armend Shaban Shabani:
  Restricted Lego Towers. J. Autom. Lang. Comb. 25(1): 61-76 (2020)
• 
  Martin Plátek, Friedrich Otto, Frantisek Mráz:
  On h-Lexicalized Restarting List Automata. J. Autom. Lang. Comb. 25(2-3): 201-234 (2020)
• 
  Tomoyuki Yamakami:
  One-Way Topological Automata and the Tantalizing Effects of Their Topological Features. J. Autom. Lang. Comb. 25(2-3): 235-273 (2020)
• 
  Niklas Zechner:
  Derivatives of Regular Expressions with Cuts. J. Autom. Lang. Comb. 25(4): 349-355 (2020)