Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1981

Mathematical Foundations of Computer Science 1981

10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings

Editors:

  1. Jozef Gruska
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michal Chytil
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Sections

Buy it now

Softcover Book USD 54.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 (57 papers)

  1. Front Matter

    PDF

  4. Probabilistic two-way machines

    • RÅ«siņš Freivalds
    Pages 33-45

  6. A survey on oracle techniques

    • B. Korte, R. Schrader
    Pages 61-77

  7. Time and space bounded complexity classes and bandwidth constrained problems

    • Burkhard Monien, Ivan Hal Sudborough
    Pages 78-93

  9. Parsing strategies: A concise survey

    • Anton Nijholt
    Pages 103-120

  10. The art of dynamizing

    • Jan van Leeuwen, Mark H. Overmars
    Pages 121-131

  12. Generalizations of Petri nets

    • Rüdiger Valk
    Pages 140-155

  13. Partial match retrieval in implicit data structures

    • Helmut Alt, Kurt Mehlhorn, J. Ian Munro
    Pages 156-161

  14. A characterization of Floyd-provable programs

    • H. Andréka, I. Németi, I. Sain
    Pages 162-171

  15. Semantics of CSP via translation into CCS

    • Egidio Astesiano, Elena Zucca
    Pages 172-182

  16. More about the "geography" of context-free languages

    • J. Beauquier, J. Berstel
    Pages 183-192

  17. On the power of algebraic specifications

    • J. A. Bergstra, M. Broy, J. V. Tucker, M. Wirsing
    Pages 193-204

  19. On the complexity of word problems in certain Thue systems

    • R. Book, M. Jantzen, B. Monien, C. Ó'Dúnlaing, C. Wrathall
    Pages 216-223
Back to top

Keywords

Back to top

Bibliographic Information

  • Book Title: Mathematical Foundations of Computer Science 1981

  • Book Subtitle: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings

  • Editors: Jozef Gruska, Michal Chytil

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-10856-4

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1981

  • Softcover ISBN: 978-3-540-10856-6Published: 01 August 1981

  • eBook ISBN: 978-3-540-38769-5Published: 01 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XI, 590

  • Topics: Theory of Computation, Algorithm Analysis and Problem Complexity

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

Softcover Book USD 54.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

Search

Navigation