Mathematical Foundations of Computer Science 1988: 13th Symposium Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Proceedings [Paperback]

This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation.Sparse sets, tally sets, and polynomial reducibilities.- Functional programming and combinatory algebras.- On models and algebras for concurrent processes.- String matching with constraints.- Structure of complexity classes: Separations, collapses, and completeness.- Inductive syntactical synthesis of programs from sample computations.- 3-dimensional shortest paths in the presence of polyhedral obstacles.- Robust oracle machines.- Recognizable sets with multiplicities in the tropical semiring.- Reusable specification components.- Comparing interconnection networks.- Probabilistic automata complexity of languages depends on language structure and error probability.- Breadth-first phrase structure grammars and queue automata.- Implementing abstract data structures in hardware.- Distribution of Sequential Processes.- Automata and rational expressions on planar graphs.- On maximal prefix sets of words.- Infinite behaviour of deterministic petri nets.- Testing isomorphism of outerplanar graphs in parallel.- Efficient simulations between concurrent-read concurrent-write pram models.- Multiple propositional dynamic logic of parallel programs.- The steiner tree problem and homogeneous sets.- Termination of rewriting is undecidable in the one-rvle case.- Local checking of trace synchronizability.- Edge separators for planar graphs and their applications.- A fast parallel algorithm forlS*