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

• 1999
• 
  Eberhard Bertsch:
  Abstract Comparison of two Error Detection Techniques for Programming Languages. J. Autom. Lang. Comb. 4(2): 77-86 (1999)
• 
  Véronique Bruyère:
  Editorial. J. Autom. Lang. Comb. 4(3): 149-151 (1999)
• 
  Véronique Bruyère, Clelia de Felice:
  On the Existence of Codings Between Trace Monoids. J. Autom. Lang. Comb. 4(2): 87-100 (1999)
• 
  Julien Cassaigne:
  Double Sequences with Complexity mn+1. J. Autom. Lang. Comb. 4(3): 153-170 (1999)
• 
  Christian Choffrut, Hratchia Pélibossian, Pierre Simonnet:
  Decision Issues on Functions Realized by Finite Automata. J. Autom. Lang. Comb. 4(3): 171-181 (1999)
• 
  James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit:
  Separating Words with Small Grammars. J. Autom. Lang. Comb. 4(2): 101-110 (1999)
• 
  Jeanne Devolder:
  Generators with Bounded Deciphering Delay for Rational ω-Languages. J. Autom. Lang. Comb. 4(3): 183-204 (1999)
• 
  Jean-Pierre Duval, Laurent Mouchard:
  Sequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words. J. Autom. Lang. Comb. 4(3): 205-211 (1999)
• 
  Clelia de Felice:
  Hajós Factorizations of Cyclic Groups - A Simpler Proof of a Characterization. J. Autom. Lang. Comb. 4(2): 111-116 (1999)
• 
  Henning Fernau, Frank Stephan:
  Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer. J. Autom. Lang. Comb. 4(2): 117-142 (1999)
• 
  Costas S. Iliopoulos, Laurent Mouchard:
  Quasiperiodicity: From Detection to Normal Forms. J. Autom. Lang. Comb. 4(3): 213-228 (1999)
• 
  Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
  On Monotonic Automata with a Restart Operation. J. Autom. Lang. Comb. 4(4): 287-311 (1999)
• 
  Rainer Kemp:
  On Leftist Simply Generated Trees. J. Autom. Lang. Comb. 4(4): 313-331 (1999)
• 
  Maria Madonia, Sergio Salemi, Tecla Sportelli:
  Covering Submonoids and Covering Codes. J. Autom. Lang. Comb. 4(4): 333-350 (1999)
• 
  Arnaud Maes:
  An Automata Theoretic Decidability Proof for First-Order Theory of ⟨ℕ,<,P⟩ with Morphic Predicate P. J. Autom. Lang. Comb. 4(3): 229-245 (1999)
• 
  Carlos Martín-Vide, Gheorghe Paun:
  Cooperating Distributed Splicing Systems. J. Autom. Lang. Comb. 4(1): 3-16 (1999)
• 
  Ion Petre:
  Parikh's Theorem Does Not Hold for Multiplicities. J. Autom. Lang. Comb. 4(1): 17-30 (1999)
• 
  Jean-François Raskin, Pierre-Yves Schobbens:
  The Logic of Event Clocks - Decidability, Complexity and Expressiveness. J. Autom. Lang. Comb. 4(3): 247-282 (1999)
• 
  Huei-Jan Shyr, Shyr-Shen Yu:
  Some Properties of Left Non-Cancellative Languages. J. Autom. Lang. Comb. 4(4): 351-360 (1999)
• 
  Dietmar Wätjen:
  Teams of Limited and Uniformly Limited 0L Systems. J. Autom. Lang. Comb. 4(1): 31-57 (1999)
• 
  Liang Zhang, Kar-Ping Shum, Shou-Li Peng:
  Generalized Prefix Relations and Codes with Finite Decoding Delay. J. Autom. Lang. Comb. 4(1): 59-71 (1999)