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

• 2016
• 
  Hendrikus J. S. Basten:
  Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata. DLT 2016: 1-12
• 
  Nicolas Bedon:
  Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets. DLT 2016: 13-25
• 
  Dmitry Berdinsky:
  Cayley Automatic Groups and Numerical Characteristics of Turing Transducers. DLT 2016: 26-37
• 
  Devendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi:
  A Perfect Class of Context-Sensitive Timed Languages. DLT 2016: 38-50
• 
  Adrien Boiret, Raphaela Palenta:
  Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time. DLT 2016: 355-367
• 
  Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
  Position Automaton Construction for Regular Expressions with Intersection. DLT 2016: 51-63
• 
  Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange:
  A Language-Theoretical Approach to Descriptive Complexity. DLT 2016: 64-76
• 
  Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland:
  k-Abelian Equivalence and Rationality. DLT 2016: 77-88
• 
  Liang-Ting Chen, Henning Urbat:
  Schützenberger Products in a Category. DLT 2016: 89-101
• 
  Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
  Outfix-Guided Insertion - (Extended Abstract). DLT 2016: 102-113
• 
  Christian Choffrut, Bruno Guillon:
  Both Ways Rational Functions. DLT 2016: 114-124
• 
  Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier:
  Aperiodic String Transducers. DLT 2016: 125-137
• 
  Tobias Denkinger:
  An Automata Characterisation for Multiple Context-Free Languages. DLT 2016: 138-150
• 
  Stefan Dück:
  Weighted Automata and Logics on Infinite Graphs. DLT 2016: 151-163
• 
  Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
  Degrees of Infinite Words, Polynomials and Atoms. DLT 2016: 164-176
• 
  Daniil Gasnikov, Arseny M. Shur:
  Ternary Square-Free Partial Words with Many Wildcards. DLT 2016: 177-189
• 
  Viliam Geffert:
  Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space. DLT 2016: 190-202
• 
  Luisa Herrmann, Heiko Vogler:
  Weighted Symbolic Automata with Data Storage. DLT 2016: 203-215
• 
  Oscar H. Ibarra, Ian McQuillan:
  On Families of Full Trios Containing Counter Machine Languages. DLT 2016: 216-228
• 
  Jozef Jirásek Jr.:
  Non-regular Maximal Prefix-Free Subsets of Regular Languages. DLT 2016: 229-242
• 
  Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej:
  Operations on Unambiguous Finite Automata. DLT 2016: 243-255
• 
  Dietrich Kuske, Olena Prianychnykova:
  The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids. DLT 2016: 256-267
• 
  Kent Kwee, Friedrich Otto:
  On Ordered RRWW-Automata. DLT 2016: 268-279
• 
  Sébastien Labbé, Julien Leroy:
  Bispecial Factors in the Brun S-Adic System. DLT 2016: 280-292
• 
  Andreas Maletti:
  Compositions of Tree-to-Tree Statistical Machine Translation Models. DLT 2016: 293-305
• 
  Florin Manea, Dirk Nowotka, Markus L. Schmid:
  On the Solvability Problem for Restricted Classes of Word Equations. DLT 2016: 306-318
• 
  Henryk Michalewski, Michal Skrzypczak:
  Unambiguous Büchi Is Weak. DLT 2016: 319-331
• 
  Dirk Nowotka, Aleksi Saarela:
  One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations. DLT 2016: 332-343
• 
  Pascal Ochem, Matthieu Rosenfeld:
  Avoidability of Formulas with Two Variables. DLT 2016: 344-354
• 
  Erik Paul:
  On Finite and Polynomial Ambiguity of Weighted Tree Automata. DLT 2016: 368-379

skipping 3 more matches