Skip to main content
  • Conference proceedings
  • © 1988

Mathematical Foundations of Computer Science 1988

13th Symposium Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Proceedings

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

Buy it now

Buying options

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (53 papers)

  1. Front Matter

  2. On models and algebras for concurrent processes

    • Ludmila A. Cherkasova
    Pages 27-43
  3. String matching with constraints

    • Maxime Crochemore
    Pages 44-58
  4. Robust oracle machines

    • Uwe Schöning
    Pages 93-106
  5. Reusable specification components

    • Martin Wirsing, Rolf Hennicker, Ruth Breu
    Pages 121-137
  6. Comparing interconnection networks

    • Burkhard Monien, Hal Sudborough
    Pages 138-153
  7. Breadth-first phrase structure grammars and queue automata

    • E. Allevi, A. Cherubini, S. Crespi Reghizzi
    Pages 162-170
  8. Implementing abstract data structures in hardware

    • Frank Bauernöppel, Hermann Jung
    Pages 171-179
  9. Distribution of Sequential Processes

    • J. Beauquier, A. Petit
    Pages 180-189
  10. Automata and rational expressions on planar graphs

    • Francis Bossut, Max Dauchet, Bruno Warin
    Pages 190-200
  11. On maximal prefix sets of words

    • Véronique Bruyere
    Pages 201-209
  12. Infinite behaviour of deterministic petri nets

    • Heino Carstensen
    Pages 210-219
  13. Testing isomorphism of outerplanar graphs in parallel

    • Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik
    Pages 220-230

About this book

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.

Bibliographic Information

  • Book Title: Mathematical Foundations of Computer Science 1988

  • Book Subtitle: 13th Symposium Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Proceedings

  • Editors: Michal P. Chytil, Václav Koubek, Ladislav Janiga

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0017126

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1988

  • Softcover ISBN: 978-3-540-50110-7Published: 10 August 1988

  • eBook ISBN: 978-3-540-45926-2Published: 23 November 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: IX, 563

  • Topics: Theory of Computation, Computation by Abstract Devices

Buy it now

Buying options

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access