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

• 2008
• 
  Sergey A. Afonin, Elena Khazova:
  Semigroups of regular languages over a one letter alphabet are rational. AFL 2008: 61-73
• 
  Thomas Ang, Janusz A. Brzozowski:
  Continuous Languages. AFL 2008: 74-85
• 
  Miklós Bartha:
  Simulation equivalence of automata and circuits. AFL 2008: 86-99
• 
  Christiane Bercoff:
  Counting of a family of column-convex rectilinear tiles. AFL 2008: 100-110
• 
  Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott:
  Counting Distinct Squares in Partial Words. AFL 2008: 122-133
• 
  Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin:
  Computing Weak Periods of Partial Words. AFL 2008: 134-145
• 
  Luca Breveglieri, Alessandra Cherubini, Claudia Di Nucci, Emanuele Rodaro:
  NP-completeness of the alphabetical satisfiability problem for trace equations. AFL 2008: 111-121
• 
  Carlos Cruz-Reyes, Jarkko Kari:
  Non-Linear Subband Coding with Cellular Automata. AFL 2008: 146-157
• 
  Jürgen Dassow, Bianca Truthe:
  Subregularly Tree Controlled Grammars and Languages. AFL 2008: 158-169
• 
  Zsolt Gazdag, Zoltán L. Németh:
  A Kleene Theorem for Binoid Languages. AFL 2008: 170-182
• 
  Viliam Geffert, Andrew Badr, Ian Shipman:
  Hyper-Minimizing Minimized Deterministic Automata. AFL 2008: 9-30
• 
  Helmut Jürgensen, Ian McQuillan:
  Homomorphisms Preserving Types of Density. AFL 2008: 183-194
• 
  Michael Kaminski, Daniel Zeitlin:
  Extending finite-memory automata with non-deterministic reassignment (Extended abstract). AFL 2008: 195-207
• 
  Alica Kelemenová, Tomás Bartík:
  Monocultures in eco-grammar systems. AFL 2008: 208-219
• 
  Ondrej Klíma, Libor Polák:
  Literally idempotent languages and their varieties - two letter case. AFL 2008: 220-231
• 
  Miklós Krész:
  Automata associated with open conjugated systems. AFL 2008: 232-244
• 
  Dietrich Kuske, Markus Lohrey:
  Euler paths and ends in automatic and recursive graphs. AFL 2008: 245-256
• 
  Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
  On Stateless Two-Pushdown Automata and Restarting Automata. AFL 2008: 257-268
• 
  Tommi Lehtinen, Alexander Okhotin:
  Boolean grammars and gsm mappings. AFL 2008: 269-280
• 
  Peter Leupold:
  How to Pop a Deep PDA Matters. AFL 2008: 281-291
• 
  Markus Lohrey:
  Compressed membership problems revisited. AFL 2008: 31-53
• 
  Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
  Sublinearly Space Bounded Iterative Arrays. AFL 2008: 292-301
• 
  Florin Manea, Victor Mitrana, Takashi Yokomori:
  Some Remarks on the Hairpin Completion. AFL 2008: 302-313
• 
  Pavel V. Martyugin:
  Complexity of problems concerning reset words for commutative automata and automata with simple idempotents. AFL 2008: 314-324
• 
  Tomás Masopust, Alexander Meduna:
  On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. AFL 2008: 325-336
• 
  Jean Marcel Pallo:
  Kleene revisited by Suschkewitsch. AFL 2008: 337-348
• 
  Gheorghe Paun:
  Membrane Computing: Recent Developments and Applications (Extended Abstract). AFL 2008: 350-351
• 
  Ion Petre:
  Mathematics of gene assembly in ciliates (Abstract). AFL 2008: 54-55
• 
  Tamás Roska:
  Cellular Wave Computers - Algorithms for million processor computers (Abstract). AFL 2008: 352
• 
  Jacques Sakarovitch:
  The sequentialisation of automata and transducers (Abstract). AFL 2008: 56-57

skipping 2 more matches