Abstract is missing.
- Generalized Heterogeneous Algebras and Partial InterpretationsManfred Broy, Martin Wirsing. 1-34
- Applicative Information SystemsMario Coppo, Mariangiola Dezani-Ciancaglini, Giuseppe Longo. 35-64
- Acyclic Database Schemes (of Various Degrees): A Painless IntroductionRonald Fagin. 65-89
- Efficient Algorithms for Finding Maximal Matching in GraphsZvi Galil. 90-113
- A Survey of NLC GrammarsDirk Janssens, Grzegorz Rozenberg. 114-128
- Prefix and Perfect LanguagesJoffroy Beauquier. 129-140
- Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice NetsEike Best, M. W. Shields. 141-154
- VLSI Mesh of Trees for Data Base ProcessingMaurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli. 155-166
- Continuite des transducteurs d états finis d arbesM. F. Claerebout, Eric Lilin. 167-178
- Completeness Results for a Polymorphic Type SystemMario Coppo, Elio Giovannetti. 179-190
- A Class of Program Schemes Based on Tree Rewriting SystemsBruno Courcelle, F. Lavandier. 191-204
- Complete Sets of Unifiers and Matchers in Equational TheoriesFrançois Fages, Gérard P. Huet. 205-220
- Digital Search Trees and the Generation of an Exponentially Distributed VariatePhilippe Flajolet, Nasser Saheb. 221-235
- Decidable Properties of Monadic Recursive Schemas with a Depth ParameterJacob Gonczaroski. 236-254
- Nivat-Processing Systems: Decision Problems Related to Protection and SynchronizationSorin Istrail, Cristian Masalagiu. 255-268
- Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data TypesJean-Pierre Jouannaud. 269-283
- An Application of Maximum Bipartite C-Matching to Subtree IsomorphismAndrzej Lingas. 284-299
- Characterizing Specification Languages Which Admit Initial SemanticsBernd Mahr, Johann A. Makowsky. 300-316
- Topological BandwidthFillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough. 317-331
- Probabilistic Analysis of Graph Colouring AlgorithmsAlberto Marchetti-Spaccamela, Maurizio Talamo. 332-340
- Some Further Approximation Algorithms for the Vertex Cover ProblemBurkhard Monien, Ewald Speckenmeyer. 341-349
- An Application of the Theory of Graphs and Hypergraphs to the Decomposition of Relational Database SchemesJan Paredaens, Dirk Van Gucht. 350-366
- Remarks on the Pyramidal StructureWojciech Rytter. 367-376
- Structured Theories in LCFDonald Sannella, Rod M. Burstall. 377-391
- Alternating Tree AutomataGiora Slutzki. 392-404
- Cofinality in Reduction GraphsMarisa Venturini Zilli. 405-416