Fundamentals of Computation Theory | International Conference FCT '89, Szeged, Hungary, August 21-25, 1989. Proceedings

Janos Csirik (u. a.)

ISBN 10: 3540514988 / ISBN 13: 9783540514985

Verlag: Springer-Verlag GmbH, 1989

Beschreibung

Fundamentals of Computation Theory | International Conference FCT '89, Szeged, Hungary, August 21-25, 1989. Proceedings | Janos Csirik (u. a.) | Taschenbuch | xiv | Englisch | 1989 | Springer-Verlag GmbH | EAN 9783540514985 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Bestandsnummer des Verkäufers 102142437

Bibliografische Details

• Titel: Fundamentals of Computation Theory | International Conference FCT '89, Szeged, Hungary, August 21-25, 1989. Proceedings
• Verlag: Springer-Verlag GmbH
• Erscheinungsjahr: 1989
• Sprache: Englisch
• ISBN-10: 3540514988
• ISBN-13: 9783540514985
• Einband: Taschenbuch
• Zustand: Neu
• Abmessungen: 235B x 155 H x 28 T Millimeter Breite: 235 mm, Höhe: 155 mm, Tiefe: 28 mm
• Gewicht: 774 Gramm
• Verkäuferkataloge:
  • Bücher

Über diesen Titel

Inhaltsangabe

This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections: - Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing; - Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming; - Formal Languages: Rewriting Systems, Algebraic Language Theory; - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds.