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

• 2003
• 
  Dimitry S. Ananichev, Mikhail V. Volkov:
  Synchronizing Monotonic Automata. Developments in Language Theory 2003: 111-121
• 
  Marcella Anselmo, Maria Madonia:
  Covering Problems from a Formal Language Point of View. Developments in Language Theory 2003: 122-133
• 
  Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
  Quantum Computing: 1-Way Quantum Automata. Developments in Language Theory 2003: 1-20
• 
  Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
  Regular Languages Generated by Reflexive Finite Splicing Systems. Developments in Language Theory 2003: 134-145
• 
  Björn Borchardt:
  The Myhill-Nerode Theorem for Recognizable Tree Series. Developments in Language Theory 2003: 146-158
• 
  Anne Bouillard, Jean Mairesse:
  Generating Series of the Trace Group. Developments in Language Theory 2003: 159-170
• 
  Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi:
  Residual Finite Tree Automata. Developments in Language Theory 2003: 171-182
• 
  Pascal Caron, Marianne Flouret:
  From Glushkov WFAs to Rational Expressions. Developments in Language Theory 2003: 183-193
• 
  Jean-Marc Champarnaud, Fabien Coulon:
  NFA Reduction Algorithms by Means of Regular Inequalities. Developments in Language Theory 2003: 194-205
• 
  Erzsébet Csuhaj-Varjú, Victor Mitrana, György Vaszil:
  Distributed Pushdown Automata Systems: Computational Power. Developments in Language Theory 2003: 218-229
• 
  Flavio D'Alessandro, Stefano Varricchio:
  On Well Quasi-orders on Languages. Developments in Language Theory 2003: 230-241
• 
  Michael Domaratzki:
  On Enumeration of Müller Automata. Developments in Language Theory 2003: 254-265
• 
  Frank Drewes, Joost Engelfriet:
  Branching Grammars: A Generalization of ET0L Systems. Developments in Language Theory 2003: 266-278
• 
  Frank Drewes, Johanna Högberg:
  Learning a Regular Tree Language from a Teacher. Developments in Language Theory 2003: 279-291
• 
  Javier Esparza:
  An Automata-Theoretic Approach to Software Verification. Developments in Language Theory 2003: 21
• 
  Diego de Falco, Massimiliano Goldwurm, Violetta Lonati:
  Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models. Developments in Language Theory 2003: 242-253
• 
  Rudolf Freund, Carlos Martín-Vide, Adam Obtulowicz, Gheorghe Paun:
  On Three Classes of Automata-Like P Systems. Developments in Language Theory 2003: 292-303
• 
  Ferenc Gécseg:
  Comments on Complete Sets of Tree Automata. Developments in Language Theory 2003: 22-34
• 
  Dora Giammarresi:
  Computing Languages by (Bounded) Local Sets. Developments in Language Theory 2003: 304-315
• 
  Antonio Cano Gómez, Jean-Eric Pin:
  On a Conjecture of Schnoebelen. Developments in Language Theory 2003: 35-54
• 
  Tero Harju, Dirk Nowotka:
  About Duval's Conjecture. Developments in Language Theory 2003: 316-324
• 
  Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau:
  Computation with Absolutely No Space Overhead. Developments in Language Theory 2003: 325-336
• 
  Dieter Hofbauer, Johannes Waldmann:
  Deleting String Rewriting Systems Preserve Regularity. Developments in Language Theory 2003: 337-348
• 
  Markus Holzer, Barbara König:
  On Deterministic Finite Automata and Syntactic Monoid Size, Continued. Developments in Language Theory 2003: 349-360
• 
  Markus Holzer, Martin Kutrib:
  Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. Developments in Language Theory 2003: 361-372
• 
  Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur:
  Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. Developments in Language Theory 2003: 373-385
• 
  Andreas Malcher:
  Minimizing Finite Automata Is Computationally Hard. Developments in Language Theory 2003: 386-397
• 
  Alexander Okhotin:
  Boolean Grammars. Developments in Language Theory 2003: 398-410
• 
  Friedrich Otto:
  Restarting Automata and Their Relations to the Chomsky Hierarchy. Developments in Language Theory 2003: 55-74
• 
  Wojciech Plandowski:
  Test Sets for Large Families of Languages. Developments in Language Theory 2003: 75-94

skipping 5 more matches