21. ICALP 1994: Jerusalem, Israel
Serge Abiteboul, Eli Shamir (Eds.):
Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings.
Lecture Notes in Computer Science 820 Springer 1994, ISBN 3-540-58201-0
Theory of Computation
- Pavel Pudlák:
Unexpected Upper Bounds on the Complexity of Some Communication Games.
1-10
- Henning Fernau, Ludwig Staiger:
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry.
11-22
- Hava T. Siegelmann:
On The Computational Power of Probabilistic and Faulty Neural Networks.
23-34
Automata, Computation Models
Expressive Power
Automata, Concurrency
Pattern Matching
Data Structures
Computation Complexity
Semantics,
Logic and Verification I
Semantics,
Logic and Verification II
Formal Languages
- Manfred Droste:
A KLeene Theorem for Recognizable Languages over Concurrency Monoids.
388-399
- Helmut Seidl:
Least Solutions of Equations over N.
400-411
- Günter Hotz, Gisela Pitsch:
Fast Uniform Analysis of Coupled-Context-Free Languages.
412-423
- Jean-Eric Pin:
Polynomial Closure of Group Languages and Open Sets of the Hall Topology.
424-435
Term Rewriting Systems
Algorithms and Communications
Graph Algorithms
Randomized Complexity
Various Algorithms
Copyright © Tue Feb 9 19:28:09 2010
by Michael Ley (ley@uni-trier.de)