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

• 2003
• 
  Henning Bordihn:
  On the Number of Components in Cooperating Distributed Grammar Systems. DCFS 2003: 81-89
• 
  Jean-Marc Champarnaud, Thomas Paranthoën:
  Random DFAs over a Non-Unary Alphabet. DCFS 2003: 90-101
• 
  Mark Daley, Ian McQuillan:
  Template-Guided DNA Recombination. DCFS 2003: 235-244
• 
  Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura:
  Some Remarks on Primitive Words and Palindromes. DCFS 2003: 245-254
• 
  Rudolf Freund, Marion Oswald, Petr Sosík:
  Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities. DCFS 2003: 102-113
• 
  Radu Gramatovici, Martin Plátek:
  Proper Dependency Grammars. DCFS 2003: 255-264
• 
  Jozef Gruska:
  Succinctness in Quantum Information Processing. DCFS 2003: 15-25
• 
  Markus Holzer:
  On the Descriptional Complexity of Finite Automata With Modified Acceptance Conditions. DCFS 2003: 26-41
• 
  Galina Jirásková:
  State Complexity of Some Operations on Regular Languages. DCFS 2003: 114-125
• 
  Martin Kappes, Frank Nießner:
  Succinct Representations of Languages by DFA With Different Levels of Reliability. DCFS 2003: 126-137
• 
  Alica Kelemenová:
  Descriptional Complexity of Eco-Grammar Systems. DCFS 2003: 42-52
• 
  Martin Kutrib:
  On the Descriptional Power of Heads, Counters, and Pebbles. DCFS 2003: 138-149
• 
  Lakshmanan Kuppusamy, Raghavan Rama:
  Descriptional Complexity of Rewriting Tissue P Systems. DCFS 2003: 150-161
• 
  Andreas Malcher:
  On Two-Way Communication in Cellular Automata With a Fixed Number of Cells. DCFS 2003: 162-173
• 
  Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan:
  Context-Free Insertion-Deletion Systems. DCFS 2003: 265-273
• 
  Filippo Mera, Giovanni Pighizzini:
  Complementing Unary Nondeterministic Automata. DCFS 2003: 174-185
• 
  Victor Mitrana:
  Some Complexity Aspects of Hybrid Networks of Evolutionary Processors. DCFS 2003: 53-65
• 
  Alexander Okhotin:
  On the Number of Nonterminals in Linear Conjunctive Grammars. DCFS 2003: 274-283
• 
  Gheorghe Paun:
  Descriptional Complexity Issues in Membrane Computing. DCFS 2003: 66-77
• 
  Mario J. Pérez-Jiménez, Álvaro Romero Jiménez, Fernando Sancho-Caparrini:
  A Polynomial Complexity Class in P Systems Using Membrane Division. DCFS 2003: 284-294
• 
  Holger Petersen:
  Complexity Results for Prefix Grammars. DCFS 2003: 295-302
• 
  Martin Plátek, Friedrich Otto, Frantisek Mráz:
  Restarting Automata and Variants of j-Monotonicity. DCFS 2003: 303-312
• 
  Ralf Stiebe:
  Positive Valence Grammars. DCFS 2003: 186-197
• 
  Bettina Sunckel:
  On the Descriptional Complexity of External Hybrid Cooperating Distributed Grammar Systems. DCFS 2003: 198-209
• 
  György Vaszil:
  On the Number of Conditional Productions in Simple Semi-conditional Grammars. DCFS 2003: 210-220
• 
  Sergey Verlan:
  A Frontier Result on Enhanced Time-Varying Distributed H Systems with Parallel Computations. DCFS 2003: 221-232
• 
  Erzsébet Csuhaj-Varjú, Chandra M. R. Kintala, Detlef Wotschke, György Vaszil:
  5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12 - 14, 2003. Proceedings. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary 2003, ISBN 963-311-356-3 [contents]