Volume 14,
1981
- Georg Gato:
Some Elements of a Galois Theory of the Structure and Complexity of the Tree Automorphism Problem.
1-17
- Jürgen Schulte Mönting:
Merging of 4 or 5 Elements with n Elements.
19-37
- Yasuaki Nishitani, Namio Honda:
The Firing Squad Synchronization Problem for Graphs.
39-61
- Ernst L. Leiss:
On Generalized Language Equations.
63-77
- Arnon Rosenthal:
Optimal Algorithms for Sensitivity Analysis in Associative Multiplication Problems.
79-90
- Timothy J. Long:
On gamma-Reducibility Versus Polynomial Time Many-One Reducibility.
91-101
- Zvi Galil:
On the Theoretical Efficiency of Various Network Flow Algorithms.
103-111
- Dexter Kozen, Rohit Parikh:
An Elementary Proof of the Completness of PDL.
113-118
- Michel Latteux:
A Propos du Lemme de Substitution.
119-123
- Matthias Jantzen:
The Power of Synchronizing Operations on Strings.
127-154
- Jean H. Gallier:
DPDA's in `Atomic Normal Form' and Applications to Equivalence Problems.
155-186
- Joffroy Beauquier:
Substitution of Semi-AFL'S.
187-193
- Denis Thérien:
Classification of Finite Monoids: The Language Approach.
195-208
- Akira Maruoka, Masayuki Kimura, Nobuyoshi Shoji:
Pattern Decomposition for Tessellation Automata.
211-226
- Walter Bucher, Hermann A. Maurer, Karel Culik II, Detlef Wotschke:
Concise Description of Finite Languages.
227-246
- Janusz Stoklosa, Wojciech Zakowski:
Computations of (alpha, k)-Machines.
247-265
- Grzegorz Rozenberg, R. Verraedt:
On Pure, Terminal Invariant and Nonterminal Invariant Interpretations of E0L Forms.
267-288
- Shlomo Moran:
General Approximation Algorithms for some Arithmetical Combinatorial Problems.
289-303
- G. Callegarin, Giuliano Pacini:
About the Implementability and the Power of Equationally Defined Data Abstractions.
305-315
- Kurt Jensen:
Coloured Petri Nets and the Invariant-Method.
317-336
- Walter Bucher:
A Note on a Problem in the Theory of Grammatical Complexity.
337-344
Copyright © Mon Dec 7 20:21:43 2009
by Michael Ley (ley@uni-trier.de)
