Skip to main content
  • Conference proceedings
  • © 1993

Mathematical Foundations of Computer Science 1993

18th International Symposium, MFCS’93, Gdańsk, Poland, August 30–September 3, 1993 Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 711)

Conference series link(s): MFCS: International Symposium on Mathematical Foundations of Computer Science

Conference proceedings info: MFCS 1993.

Buying options

eBook USD 109.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-47927-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 139.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (68 papers)

  1. Front Matter

  2. On the unification free prolog programs

    • Krzysztof R. Apt, Sandro Etalle
    Pages 1-19
  3. Equivalences and preorders of transition systems

    • A. Arnold, A. Dicky
    Pages 20-31
  4. Complex and complex-like traces

    • Volker Diekert
    Pages 68-82
  5. Symbolic bisimulations (abstract)

    • Matthew Hennessy
    Pages 83-83
  6. The second calculus of binary relations

    • Vaughan Pratt
    Pages 142-155
  7. An introduction to dynamic labeled 2-structures

    • A. Ehrenfeucht, G. Rozenberg
    Pages 156-173
  8. A taste of linear logic

    • Philip Wadler
    Pages 185-210
  9. On the tree inclusion problem

    • Laurent Alonso, René Schott
    Pages 211-221
  10. On the adequacy of per models

    • Roberto M. Amadio
    Pages 222-231
  11. Hausdorff reductions to sparse sets and to sets of high information content

    • V. Arvind, J. Köbler, M. Mundhenk
    Pages 232-241
  12. Stores as homomorphisms and their transformations

    • Egidio Astesiano, Gianna Reggio, Elena Zucca
    Pages 242-251
  13. Comparative semantics for linear arrays of communicating processes

    • J. W. de Bakker, F. van Breugel, A. de Bruin
    Pages 252-261
  14. Rabin tree automata and finite monoids

    • Danièle Beauquier, Andreas Podelski
    Pages 262-271

Other Volumes

  1. Mathematical Foundations of Computer Science 1993

    18th International Symposium, MFCS'93 Gdańsk, Poland, August 30–September 3, 1993 Proceedings

About this book

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.

Keywords

  • Complexity
  • Computer Science
  • Graph Theory
  • Komplexität
  • Lambda Calculus
  • Lambda-Kalküle
  • Process Algebras
  • Prozeßalgebren
  • Semantics
  • Semantik
  • algorithms
  • programming
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

eBook USD 109.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-47927-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 139.00
Price excludes VAT (USA)