Abstract is missing.
- Regular extensions of iterative algebras and metric interpretationsJan A. Bergstra, Jerzy Tiuryn. 1-10
- Séries formelles reconnaissables d arbres et applicationsJean Berstel, Christophe Reutenauer. 11-21
- On the analysis of tree-matching algorithmsPhilippe Flajolet, Jean-Marc Steyaert. 22-40
- Sur un résultat récent de Laurent ChottinDominique Gouyou-Beauchamps. 41-44
- Generation of treesC. L. Liu. 45-53
- Nearly deterministic automata acceptation of infinite trees and a complexitiy of weak theory of SkSAndrzej Wlodzimierz Mostowski. 54-62
- Synthesis of subtree rewriting systems behaviour by solving equationsAlberto Pettorossi. 63-74
- A criterion common to various continuous completions of albegras and X-categoriesHagen Huwig, Axel Poigné. 75-82
- La programmaion fonctionnelle de Backus est-elle système de manipulation d arbres?Bernard Robinet. 83-94
- On equivalent transformations of binary search treesHelmut Thiele. 95-109
- Delayed evaluation trees and their application to sementicsEgidio Astesiano, Gerardo Costa. 110-118
- Quelques propriétés des arbres penchés récursifsNorbert Cot. 119-129
- A schematalogical approach to the alalysis of the procedure concept in algol-languagesWerner Damm, Elfriede Fehr. 130-134
- Closure of recognisable tree-languages under intersection and morphismsJocelyne Mongy. 135-149
- The data type ent and related operations in a linguistically oriented programming languageA. Pink. 150-159
- Programming languages as abstract data typesManfred Broy, Martin Wirsing. 160-177
- Unfolding Omega nets into trees (Résumé)Gisbert Dittrich, Wolfgang Merzenich. 178-179
- Manipulation d arbres syntaxiques et contruction de programmes (Résumé)Jacques Guyard, Pierre Lescanne. 180-181
- Preuves de programmes sans inductionDidier Bégay, Laurent Kott. 182-198
- Delayed evaluation trees and their application to sementics (Additif)Egidio Astesiano, Gerardo Costa. 199
- Unfolding Omega nets into treesGisbert Dittrich, Wolfgang Merzenich. 200-207
- Manipulation d arbres syntaxiques et contruction de programmesJacques Guyard, Pierre Lescanne. 208-224
- On global word definability and constructively definable sets in N::n::Marek Karpinski. 225-227
- Finite automata on infinite trees and subtheories of SkSAndrzej Wlodzimierz Mostowski. 228-240
- L arbre des cycles d un grapheS. Gill Williamson. 241-261