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.
| Serija: | Lecture Notes in Computer Science |
| Leidėjas: | Springer Berlin Heidelberg |
| Išleidimo metai: | 1989 |
| Knygos puslapių skaičius: | 516 |
| ISBN-10: | 3540514988 |
| ISBN-13: | 9783540514985 |
| Formatas: | Knyga minkštu viršeliu |
| Kalba: | Anglų |
| Žanras: | Discrete mathematics |
Parašykite atsiliepimą apie „Fundamentals of Computation Theory: International Conference FCT 89, Szeged, Hungary, August 21-25, 1989. Proceedings“
