Computer Science

In this book the authors try to bridge the gap between the treatments of matrix theory and linear algebra. It is aimed at graduate and advanced undergraduate students seeking a foundation in mathemati

This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples.

Computing is an exact science and the systematic study of any aspect necessarily involves the use of mathematical models. Moreover, the rate at which the subject is evolving demands a facility for developing new mathematical systems to keep pace with new computing systems and this requires an appreciation of how mathematics works. An understanding of the underlying mathematical structure facilitates the construction of suitable computer programs to perform computations. Assuming no specific knowledge of mathematics, the authors describe all the basic concepts required and progress from sets (rather than numbers) through a variety of algebraic structures that permit the precise description, specification and subsequent analysis of many problems in computing. The material included provides the essential mathematical foundations for core topics of computer science and extends into the areas of language theory, abstract machine theory and computer geometry. Computer Mathematics will be of

This book is revised and expanded version of the original German text. The arrangement of the material and the structure are essentially unchanged. All remarks in the Preface to the German Edition reg

To perform computer simulation successfully, two rather different sets of skills are required. One of these relates to programming: a simulation program should do what its author intends and do it efficiently. The other is concerned with the collection and analysis of data: statistical tools have to be used in order to obtain with a minimum of effort, accurate and reliable estimates for the desired performance measures. Dr Mitrani covers both of these aspects of the simulation method. The important topics of point and interval estimation, simulation efficiency and the analysis of simulation experiments are discussed in detail. This book, first published in 1982, will be useful to both undergraduate and postgraduate students taking courses on simulation in departments of computer science, operations research and statistics in universities and polytechnics. It will be of benefit also to practitioners in the field.

By the time students have done some programming in one or two languages and have learnt the common ways of representing information in a computer, they will want to embark upon further study of theoretical or applied topics in computer science. Most will encounter problems that require for their solution one or more of the techniques described in this book: for example problems depending upon the formation and solution of different equations; the task of making lists of possible alternatives and of answering questions about them; or the search for discrete optima. Written by the same authors as the highly successful Information Representation and Manipulation in a Computer, this book describes algorithms of mathematical methods and illustrates their application with examples. The mathematical background needed is elementary algebra and calculus. Numerous exercises are provided, with hints to their solutions.

Simulating a continuous process on a (computer) model provides a means of understanding how a system will behave when it is subject to particular constraints. Computers are of particular use for this purpose as the system is one which involves differential equations, eg. the behaviour of the vehicle suspension systems and chemical reactions. The book describes how analogue, digital and hybrid computers are used in simulating continuous systems. Their use is illustrated in the text by a number of simple problems and most chapters also contain examples of varying complexity selected from a range of scientific and engineering disciplines. A short appendix describes the functioning of analogue and hybrid units; for the rest of the book a knowledge of electric circuit theory is not required.

A new version of the classic and widely used text adapted for the JavaScript programming language.Since the publication of its first edition in 1984 and its second edition in 1996, Structure and Interpretation of Computer Programs (SICP) has influenced computer science curricula around the world. Widely adopted as a textbook, the book has its origins in a popular entry-level computer science course taught by Harold Abelson and Gerald Jay Sussman at MIT. SICP introduces the reader to central ideas of computation by establishing a series of mental models for computation. Earlier editions used the programming language Scheme in their program examples. This new version of the second edition has been adapted for JavaScript. The first three chapters of SICP cover programming concepts that are common to all modern high-level programming languages. Chapters four and five, which used Scheme to formulate language processors for Scheme, required significant revision. Chapter four offers new mat

Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as 'input-output' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods t

This book constitutes the refereed proceedings of the 20th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2019, held in Cascais, Portugal, in January

This book constitutes the refereed proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018, held in Tokyo, Japan, in November 2018. The

The two-volume set LNCS 10761 + 10762 constitutes revised selected papers from the CICLing 2017 conference which took place in Budapest, Hungary, in April 2017. The total of 90 papers presented in the