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

• 2002
• 
  Henry N. Adorna:
  3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. J. Autom. Lang. Comb. 7(4): 419-432 (2002)
• 
  Talal Ali Al-Hawary:
  Characterizations of Certain Matroids via Flats. J. Autom. Lang. Comb. 7(3): 295-301 (2002)
• 
  K. Arthi, Kamala Krithivasan, Erzsébet Csuhaj-Varjú:
  On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems. J. Autom. Lang. Comb. 7(4): 433-446 (2002)
• 
  Sergey V. Avgustinovich, Anna E. Frid:
  Words Avoiding Abelian Inclusions. J. Autom. Lang. Comb. 7(1): 3-9 (2002)
• 
  Henning Bordihn, Bernd Reichel:
  On Descriptions of Context-Free Languages by CD Grammar Systems. J. Autom. Lang. Comb. 7(4): 447-454 (2002)
• 
  Patricia Bouyer, Antoine Petit:
  A Kleene/Büchi-like Theorem for Clock Languages. J. Autom. Lang. Comb. 7(2): 167-186 (2002)
• 
  Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
  Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. J. Autom. Lang. Comb. 7(3): 303-310 (2002)
• 
  Jürgen Dassow, Detlef Wotschke, Bernd Reichel:
  Editorial. J. Autom. Lang. Comb. 7(4): 417 (2002)
• 
  Michael Domaratzki:
  State Complexity of Proportional Removals. J. Autom. Lang. Comb. 7(4): 455-468 (2002)
• 
  Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit:
  On the Number of Distinct Languages Accepted by Finite Automata with n States. J. Autom. Lang. Comb. 7(4): 469-486 (2002)
• 
  Manfred Droste, Paul Gastin:
  Editorial. J. Autom. Lang. Comb. 7(2): 165 (2002)
• 
  Joost Engelfriet, Zoltán Fülöp, Heiko Vogler:
  Bottom-Up and Top-Down Tree Series Transformations. J. Autom. Lang. Comb. 7(1): 11-70 (2002)
• 
  Henning Fernau, Markus Holzer:
  Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. J. Autom. Lang. Comb. 7(4): 487-503 (2002)
• 
  Ferenc Gécseg, Balázs Imreh:
  On Monotone Automata and Monotone Languages. J. Autom. Lang. Comb. 7(1): 71-82 (2002)
• 
  Christian Germain, Jean Marcel Pallo:
  Linear Languages with a Nonassociative Concatenation. J. Autom. Lang. Comb. 7(3): 311-320 (2002)
• 
  Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
  Maximal and Minimal Partial Clones. J. Autom. Lang. Comb. 7(1): 83-93 (2002)
• 
  Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo:
  Finite Codes over Free Binoids. J. Autom. Lang. Comb. 7(4): 505-518 (2002)
• 
  Juraj Hromkovic:
  Descriptional Complexity of Finite Automata: Concepts and Open Problems. J. Autom. Lang. Comb. 7(4): 519-531 (2002)
• 
  Dietrich Kuske, Rémi Morin:
  Pomsets for Local Trace Languages. J. Autom. Lang. Comb. 7(2): 187-224 (2002)
• 
  Martin Kutrib:
  Refining Nondeterminism Below Linear Time. J. Autom. Lang. Comb. 7(4): 533-547 (2002)
• 
  Andreas Malcher:
  Descriptional Complexity of Cellular Automata and Decidability Questions. J. Autom. Lang. Comb. 7(4): 549-560 (2002)
• 
  Carlos Martín-Vide, Victor Mitrana:
  Grammars with Bounded-Life Resources. J. Autom. Lang. Comb. 7(4): 561-570 (2002)
• 
  Alexander Meduna:
  Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. J. Autom. Lang. Comb. 7(4): 571-577 (2002)
• 
  Carlo Mereghetti, Beatrice Palano:
  The Parallel Complexity of Deterministic and Probabilistic Automata. J. Autom. Lang. Comb. 7(1): 95-108 (2002)
• 
  Albert R. Meyer, Alexander Rabinovich:
  Valid Identity Problem for Shuffle Regular Expressions. J. Autom. Lang. Comb. 7(1): 109-125 (2002)
• 
  Mehryar Mohri:
  Semiring Frameworks and Algorithms for Shortest-Distance Problems. J. Autom. Lang. Comb. 7(3): 321-350 (2002)
• 
  Doron A. Peled, Moshe Y. Vardi, Mihalis Yannakakis:
  Black Box Checking. J. Autom. Lang. Comb. 7(2): 225-246 (2002)
• 
  Eileen Peluso, Jonathan Goldstine, Shashi Phoha:
  Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems. J. Autom. Lang. Comb. 7(1): 127-142 (2002)
• 
  Michel Rigo, Arnaud Maes:
  More on Generalized Automatic Sequences. J. Autom. Lang. Comb. 7(3): 351-376 (2002)
• 
  Patrice Séébold:
  About some Overlap-Free Morphisms on a n-Letter Alphabet. J. Autom. Lang. Comb. 7(4): 579-597 (2002)

skipping 6 more matches