Fundamentals of Computation Theory

Janos Csirik

ISBN 10: 3540514988 / ISBN 13: 9783540514985

Published by Springer Berlin Heidelberg Jul 1989, 1989

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 516 pp. Englisch.

Seller Inventory # 9783540514985

Bibliographic Details

• Title: Fundamentals of Computation Theory
• Publisher: Springer Berlin Heidelberg Jul 1989
• Publication Date: 1989
• Language: English
• ISBN 10: 3540514988
• ISBN 13: 9783540514985
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 28D millimeters 235 millimeters width by 155 millimeters height by 28 millimeters depth
• Weight: 774 grams

About this title

Synopsis

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.