Ebook: Fundamentals of Computation Theory: 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007. Proceedings
- Genre: Mathematics // Computational Mathematics
- Tags: Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Mathematical Logic and Formal Languages, Computer Graphics, Discrete Mathematics in Computer Science
- Series: Lecture Notes in Computer Science 4639 : Theoretical Computer Science and General Issues
- Year: 2007
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
The 16th International Symposium on Fundamentals of Computation Theory was held in Budapest, Hungary, in August 2007. This symposium drew leading minds in computation theory from around the world to present their findings and discuss new developments in the field. This volume constitutes the refereed proceedings of the symposium.
Thirty-nine full papers are presented along with four invited papers. All the papers were carefully reviewed by the editors to ensure that each one meets the highest standards of research and scholarship.
The papers address current topics in computation theory, including automata and formal languages, design and analysis of algorithms, computational and structural complexity, semantics, logic, algebra and categories in computer science, circuits and networks, learning theory, specification and verification, parallel and distributed systems, concurrency theory, cryptography and cryptographic protocols, approximation and randomized algorithms, computational geometry, quantum computation and information, and bio-inspired computation.
This book constitutes the refereed proceedings of the 16th International Symposium Fundamentals of Computation Theory, FCT 2007, held in Budapest, Hungary in August 2007.
The 39 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 147 submissions. The papers address all current topics in computation theory such as automata and formal languages, design and analysis of algorithms, computational and structural complexity, semantics, logic, algebra and categories in computer science, circuits and networks, learning theory, specification and verification, parallel and distributed systems, concurrency theory, cryptography and cryptograhic protocols, approximation and randomized algorithms, computational geometry, quantum computation and information, bio-inspired computation.