Volume 33,
1984
- Rani Siromoney, K. G. Subramanian, V. Rajkumar Dare:
Infinite Arrays and Controlled Deterministic Table 0L Array Systems.
3-11
- Matthias Jantzen, Manfred Kudlek:
Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems.
13-43
- Egidio Astesiano, Elena Zucca:
Parametric Channels via Label Expressions in CCS.
45-63
- Krzysztof R. Apt, Amir Pnueli, Jonathan Stavi:
Fair Termination Revisited-With Delay.
65-84
- Bala Ravikumar, K. B. Lakshmanan:
Coping with Known Patterns of Lies in a Search Game.
85-94
- Peter Dybjer:
Some Results on the Deductive Structure of Join Dependencies.
95-105
- C. E. Veni Madhavan:
Secondary Attribute Retrieval Using Tree Data Structures.
107-116
- Victor Y. Pan:
The Technique of Trilinear Aggregating and the Recent Progress in the Asymptotic Acceleration of Matrix Operations.
117-138
- Manfred Broy, Martin Wirsing, C. Pair:
A Systematic Study of Models of Abstract Data Types.
139-174
- Stéphane Kaplan:
Conditional Rewrite Rules.
175-193
- Elfriede Fehr:
Expressive Power of Typed and Type-Free Programming Languages.
195-238
- Yael Maon, Amiram Yehudai:
On Test Sets for Checking Morphism Equivalence on Languages with Fair Distribution of Letters.
239-260
- Friedrich Otto:
Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems.
261-278
- Neelam Soundararajan:
Denotational Semantics of CSP.
279-304
- Dung T. Huynh:
Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete.
305-326
- Tero Harju, Matti Linna:
The Equations h(w)=w-n in Binary Alphabets.
327-329
- Dominique Perrin, Paul E. Schupp:
Sur les Monoides À un Relateur qui sont des Groupes.
331-334
- Danièle Beauquier:
Bilimites de Langages Reconnaissables.
335-342
Copyright © Fri Nov 27 19:57:44 2009
by Michael Ley (ley@uni-trier.de)
