Theoretical Computer Science, Volume 37

Volume 37, 1985

• Ker-I Ko: On Some Natural Complete Operators. 1-30
• Grzegorz Rozenberg: On Coordinated Selective Substitutions: Towards a Unified Theory of Grammars and Machines. 31-50
• David E. Muller, Paul E. Schupp: The Theory of Ends, Pushdown Automata, and Second-Order Logic. 51-75
• Jan A. Bergstra, Jan Willem Klop: Algebra of Communicating Processes with Abstraction. 77-121
• Jean H. Gallier, Ronald V. Book: Reductions in Tree Replacement Systems. 123-150
• Luc Bougé: A Contribution to the Theory of Program Testing. 151-181
• Karel Culik II, Ivan Fris: Topological Transformations as a Tool in the Design of Systolic Networks. 183-216
• Jakob Gonczarowski, Manfred K. Warmuth: Applications of Scheduling Theory to Formal Language Theory. 217-243
• Robert de Simone: Higher-Level Synchronising Devices in Meije-SCCS. 245-267
• Andrzej Tarlecki: On the Existence of Free Models in Abstract Algebraic Institutuons. 269-304
• Philippe Darondeau: About Fair Asynchrony. 305-336
• Andrzej Ehrenfeucht, H. C. M. Kleijn, Grzegorz Rozenberg: Adding Global Forbidding Context to Context-Free Grammars. 337-360