Volume 115,
Number 1,
1993
Selected Papers of the 4th Summer Conference on Category Theory and Computer Science,
Paris,
France,
September 1991
Volume 115,
Number 2,
1993
- Igor Litovsky, Yves Métivier:
Computing with Graph Rewriting Systems with Priorities.
191-224
- Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer:
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time.
225-241
- Arturo Carpi:
Overlap-Free Words and Finite Automata.
243-260
- Oscar H. Ibarra, Nicholas Q. Trân:
Synchronized Finite Automata and 2DFA Reductions.
261-275
- Luc Longpré, Alan L. Selman:
Hard Promise Problems and Nonuniform Complexity.
277-290
- A. Troesch:
Interprétation géométrique de l'algorithme d'Euclide et reconnaissance de segments.
291-319
- Eric Goles Ch., Marcos A. Kiwi:
Games on Line Graphs and Sand Piles.
321-349
- R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan:
Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs.
351-357
- Masashi Katsura, Yuji Kobayashi:
The Shuffle Algebra and its Derivations.
359-369
- Shouwen Tang, Bin Fu, Tran Liu:
Exponential-Time and Subexponential-Time Sets.
371-381
- Steven Homer, Stuart A. Kurtz, James S. Royer:
On A-Truth-Table-Hard Languages.
383-389
- Sándor Vágvölgyi:
A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language.
391-399
Copyright © Fri Mar 12 17:33:07 2010
by Michael Ley (ley@uni-trier.de)