Skip to main content
SpringerLink
Log in

Foundations of Computation Theory

Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983

  • Conference proceedings
  • © 1983

Overview

Editors:
  1. Marek Karpinski
    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 158)

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

Access this book

Log in via an institution
Softcover Book USD 69.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

Licence this eBook for your library

Institutional subscriptions

Table of contents (44 papers)

  1. Front Matter

    Download chapter PDF

  2. Experiments, powerdomains and fully abstract models for applicative multiprogramming

    • Samson Abramsky
    Pages 1-13

  3. Deterministic dynamic logic of recursive programs is weaker than dynamic logic

    • Piotr Berman
    Pages 14-25

  4. Reversal-bounded and visit-bounded realtime computations

    • Andreas Brandstädt, Klaus Wagner
    Pages 26-39

  5. Input-driven languages are recognized in log n space

    • Burchard von Braunmühl, Rutger Verbeek
    Pages 40-51

  6. How to search in history

    • Bernard Chazelle
    Pages 52-63

  7. Comstructive matnkmatics as a programming logic I: Some principles of theory

    • Robert L. Constable
    Pages 64-77

  8. The classification of problems which have fast parallel algorithms

    • Stephen A. Cook
    Pages 78-93

  9. A fair calculus of communicating systems

    • Gerardo Costa, Colin Stirling
    Pages 94-105

  10. Two way finite state generators

    • Karel Culik II, Emmerich Welzl
    Pages 106-114

  11. A complete set of axioms for a theory of communicating sequential processes

    • Rocco de Nicola
    Pages 115-126

  12. The consensus problem in unreliable distributed systems (a brief survey)

    • Michael J. Fischer
    Pages 127-140

  13. Methods in the analysis of algorithms : Evaluations of a recursive partitioning process

    • Philippe Flajolet
    Pages 141-158

  14. Space and reversal complexity of probabilistic one-way turing machines

    • Rusins Freivalds
    Pages 159-170

  15. Pseudorandom number generation and space complexity

    • Merrick Furst, Richard Lipton, Larry Stockmeyer
    Pages 171-176

  16. Recurring dominoes: Making the highly undecidable highly understandable (preliminary report)

    • David Harel
    Pages 177-194

  17. Propositional dynamic logic of flowcharts

    • D. Harel, R. Sherman
    Pages 195-206

  18. Fast triangulation of simple polygons

    • Stefan Hertel, Kurt Mehlhorn
    Pages 207-218

  19. On containment problems for finite-turn languages

    • Yair Itzhaik, Amiram Yehudai
    Pages 219-231

  20. On languages generated by semigroups

    • Ladislav Janiga, Václav Koubek
    Pages 232-240
Back to top

Keywords

Bibliographic Information

  • Book Title: Foundations of Computation Theory

  • Book Subtitle: Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983

  • Editors: Marek Karpinski

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-12689-9

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1983

  • Softcover ISBN: 978-3-540-12689-8Published: 01 August 1983

  • eBook ISBN: 978-3-540-38682-7Published: 08 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIV, 522

  • Topics: Computation by Abstract Devices

Publish with us

Policies and ethics

Back to top

Search

Navigation