Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS '93, Gdansk, Poland, August 30 - September 3, 1993. Proceedings
Andrzej M. Borzyszkowski, Stefan Sokolowski
Springer, Sep 24, 1993 - Computers - 782 pages
This volume contains the proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, MFCS '93, held in Gdansk, Poland, August-September 1993. The MFCS symposia, organized annually in Poland and the former Czechoslovakia since 1972, have a long and well-established tradition. Over the years they have served as a meeting ground for specialists from all branches of theoretical computer science, in particular - algorithms and complexity, automata theory and theory of languages, - concurrent, distributed and real-time systems, - the theory of functional, logic and object-oriented programming, - lambda calculus and type theory, - semantics and logics of programs, and others. The volume contains 12 invitedlectures and 56 contributed papers selected from 133 submissions.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstraction abstraction algebras algebraic algorithm alternating Turing machines application arity atomic automata automaton axioms behaviour binary bisimulation bound called cellular automaton Chu spaces cograph coherence spaces complete component concurrent configuration congruence consider constraint construction contains corresponding defined Definition deliverables denotational semantics denote derived deterministic disjoint domain edges elements equations equivalence example exists expressions finite formula function functor given graph Hence homomorphism induction input integer isomorphism labelled lambda abstraction lambda calculus Lemma linear logic machine mapping monoid morphism natural numbers node notion NP-complete object obtained OOAFG operational semantics operations output pair paper parallel partial pebble polynomial poset predicate prefix problem Proc proof Proposition prove recursive reduction relation result rules satisfies semantics sequence sort space specification string subset symbol Theorem theory timer transformers transition system tree type theory variables vertex vertices