Mathematical Foundations Of Computer Science 1991

Download Mathematical Foundations Of Computer Science 1991 PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Mathematical Foundations Of Computer Science 1991 book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Mathematical Foundations of Computer Science 1991

Author: Andrzej Tarlecki
language: en
Publisher: Springer Science & Business Media
Release Date: 1991
This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.
Mathematical Foundations of Computer Science 1986

Author: Jozef Gruska
language: en
Publisher: Springer Science & Business Media
Release Date: 1986-08-01
Mathematical Foundations of Computer Science

Author: Peter A. Fejer
language: en
Publisher: Springer Science & Business Media
Release Date: 2012-12-06
Mathematical Foundations of Computer Science, Volume I is the first of two volumes presenting topics from mathematics (mostly discrete mathematics) which have proven relevant and useful to computer science. This volume treats basic topics, mostly of a set-theoretical nature (sets, functions and relations, partially ordered sets, induction, enumerability, and diagonalization) and illustrates the usefulness of mathematical ideas by presenting applications to computer science. Readers will find useful applications in algorithms, databases, semantics of programming languages, formal languages, theory of computation, and program verification. The material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in computer science and each chapter contains a large number of exercises. The volume can be used as a textbook, but it will also be useful to researchers and professionals who want a thorough presentation of the mathematical tools they need in a single source. In addition, the book can be used effectively as supplementary reading material in computer science courses, particularly those courses which involve the semantics of programming languages, formal languages and automata, and logic programming.