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

Saved in:
Bibliographic Details
Meeting name:FCT '89 (1989 : Szeged, Hungary)
Imprint:Berlin, Heidelberg : Springer-Verlag, 1989.
Description:1 online resource : v.: digital.
Language:English
Series:Lecture Notes in Computer Science, 0302-9743 ; 380
Lecture notes in computer science ; 380.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11078094
Hidden Bibliographic Details
Other authors / contributors:Csirik, J. (János)
Demetrovics, János.
Gécseg, F.
ISBN:9783540481805
354048180X
9783540514985
354048180X
Summary: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.
Description
Summary: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.
Physical Description:1 online resource : v.: digital.
ISBN:9783540481805
354048180X
9783540514985
ISSN:0302-9743
;