Bücher der Reihe Texts in Computer Science

This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such problems.

This classroom-tested and clearly-written textbook presents a focused guide to the conceptual foundations of compilation, explaining the fundamental principles and algorithms used for defining the syntax of languages, and for implementing simple translators.This significantly updated and expanded third edition has been enhanced with additional coverage of regular expressions, visibly pushdown languages, bottom-up and top-down deterministic parsing algorithms, and new grammar models.Topics and features: describes the principles and methods used in designing syntax-directed applications such as parsing and regular expression matching; covers translations, semantic functions (attribute grammars), and static program analysis by data flow equations; introduces an efficient method for string matching and parsing suitable for ambiguous regular expressions (NEW); presents a focus on extended BNF grammars with their general parser and with LR(1) and LL(1) parsers (NEW); introduces a parallel parsing algorithm that exploits multiple processing threads to speed up syntax analysis of large files; discusses recent formal models of input-driven automata and languages (NEW); includes extensive use of theoretical models of automata, transducers and formal grammars, and describes all algorithms in pseudocode; contains numerous illustrative examples, and supplies a large set of exercises with solutions at an associated website.Advanced undergraduate and graduate students of computer science will find this reader-friendly textbook to be an invaluable guide to the essential concepts of syntax-directed compilation. The fundamental paradigms of language structures are elegantly explained in terms of the underlying theory, without requiring the use of software tools or knowledge of implementation, and through algorithms simple enough to be practiced by paper and pencil.

This practically-oriented textbook introduces the fundamentals of designing digital surveillance systems powered by intelligent computing techniques. describes the essentials of implementing an intelligent surveillance system and analyzing surveillance data, including a range of biometric characteristics;

explains the fundamentals of automata theory, matrices, graph theory, cryptography, coding theory, language theory, and the concepts of computability and decidability;

The book covers the most essential and widely employed material in each area, particularly the material important for real-world applications. Symbolic AI covers areas such as knowledge-based systems, logical reasoning, symbolic machine learning, search techniques, and natural language processing.

In its revised fifth edition, this book covers ethical, social and policy challenges arising from the convergence of computing and telecommunication and the spread of mobile information devices. Asks important questions about the impact of new technologies.

This book presents a novel approach to database concepts, describing a categorical logic for database schema mapping based on views, within a framework for database integration and exchange and peer-to-peer computing. Includes practical examples.

This effective introduction to the key concepts in computational social science includes formal definitions and a glossary, covers topics such as information extraction, social networks and complexity theory, and discusses a range of methodological tools.

This book provides a thorough treatment of image processing with an emphasis on those aspects most used in computer graphics. The authors concentrate on describing and analyzing the underlying concepts rather than on presenting algorithms or pseudocode.

This is an introductory textbook and guide to the rapidly evolving field of predictive text mining. There are chapter summaries, historical and bibliographic remarks, and classroom-tested exercises for each chapter. Descriptive case studies are also included.

This book introduces the fundamental concepts, models, techniques, and results that form the basic paradigms of computing. It examines all the essential topics in formal languages, automata, computability, and complexity.

Introduced forty years ago, relational databases proved unusually succe- ful and durable. As a result, specialized database systems now proliferate trying to capture various pieces of the database market. The information retrieval systems were followed by database systems, which added even more structure to the data and made querying easier.

Using a HDL, Verilog in this case, rather than static circuit diagrams is a big deviation from traditional books on computer architecture.

This book explores one of the most common approaches to program verification, known as the assertional approach. Case studies supplied throughout the book demonstrate the use of the proof systems and formally verify solutions to classical problems.

This book presents current methods for dealing with software reliability, illustrating the advantages and disadvantages of each method. This reference will serve as an introduction to formal methods and techniques and will be a source for learning about various ways to enhance software reliability.

In recent years, model checking has become an essential technique for the formal verification of systems. It is perfectly suited for an advanced undergraduate or graduate class in formal verification and will serve as a valuable resource to practitioners of formal methods.