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

• 2019
• 
  Pavel Ageev:
  Implementation of the Algorithm for Testing an Automaton for Synchronization in Linear Expected Time. J. Autom. Lang. Comb. 24(2-4): 139-152 (2019)
• 
  Dmitry S. Ananichev, Vojtech Vorel:
  A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink. J. Autom. Lang. Comb. 24(2-4): 153-164 (2019)
• 
  Bas Broere, Hans Zantema:
  The k-Dimensional Cube is k-Representable. J. Autom. Lang. Comb. 24(1): 3-12 (2019)
• 
  Pascal Caron, Marianne Flouret, Ludovic Mignot:
  (k,l)-Unambiguity and Quasi-Deterministic Structures. J. Autom. Lang. Comb. 24(1): 13-49 (2019)
• 
  Arturo Carpi, Flavio D'Alessandro:
  Locally Strongly Transitive Automata in the Černý Conjecture and Related Problems. J. Autom. Lang. Comb. 24(2-4): 165-184 (2019)
• 
  Costanza Catalano, Raphaël M. Jungers:
  On Random Primitive Sets, Directable NFAs and the Generation of Slowly Synchronizing DFAs. J. Autom. Lang. Comb. 24(2-4): 185-217 (2019)
• 
  Ján Cerný:
  A Note on Homogeneous Experiments with Finite Automata. J. Autom. Lang. Comb. 24(2-4): 123-132 (2019)
• 
  Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi:
  Synchronizing Automata over Nested Words. J. Autom. Lang. Comb. 24(2-4): 219-251 (2019)
• 
  Henk Don, Hans Zantema:
  Counting Symbol Switches in Synchronizing Automata. J. Autom. Lang. Comb. 24(2-4): 253-286 (2019)
• 
  Hossein Teimoori Faal:
  A Multiset Analogue of Cofactors. J. Autom. Lang. Comb. 24(1): 65-87 (2019)
• 
  Henning Fernau, Stefan Hoffmann:
  Extensions to Minimal Synchronizing Words. J. Autom. Lang. Comb. 24(2-4): 287-307 (2019)
• 
  Achille Frigeri, Emanuele Rodaro:
  Missing Factors of Ideals and Synchronizing Automata. J. Autom. Lang. Comb. 24(2-4): 309-320 (2019)
• 
  François Gonze, Raphaël M. Jungers:
  Hardly Reachable Subsets and Completely Reachable Automata with 1-Deficient Words. J. Autom. Lang. Comb. 24(2-4): 321-342 (2019)
• 
  Toufik Mansour, Armend Shaban Shabani, Daniel Yaqubi:
  Cell Patterns in Integer Partitions. J. Autom. Lang. Comb. 24(1): 51-63 (2019)
• 
  Cyril Nicaud:
  The Černý Conjecture Holds with High Probability. J. Autom. Lang. Comb. 24(2-4): 343-365 (2019)
• 
  Yaroslav Shitov:
  An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata. J. Autom. Lang. Comb. 24(2-4): 367-373 (2019)
• 
  Peter H. Starke:
  A Remark About Homogeneous Experiments. J. Autom. Lang. Comb. 24(2-4): 133-137 (2019)
• 
  Mikhail V. Volkov:
  Preface. J. Autom. Lang. Comb. 24(2-4): 119-121 (2019)
• 
  Mikhail V. Volkov:
  Slowly Synchronizing Automata with Idempotent Letters of Low Rank. J. Autom. Lang. Comb. 24(2-4): 375-386 (2019)
• 
  Markus A. Whiteland:
  Asymptotic Abelian Complexities of Certain Morphic Binary Words. J. Autom. Lang. Comb. 24(1): 89-114 (2019)