51,99 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model´s rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel´s incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

Anbieter: buecher.de

Stand: 20.08.2019 Zum Angebot

Stand: 20.08.2019 Zum Angebot

87,99 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960´s with the work of J. Richard Biichi on monadic second-order logic. Biichi´s investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert´s book, the underlying semigroup theory has grown enor mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com puter science community, which moved to other concerns.

Anbieter: buecher.de

Stand: 20.08.2019 Zum Angebot

Stand: 20.08.2019 Zum Angebot

68,99 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Please note, Gradiance is no longer available with this book, as we no longer support this product.

Anbieter: buecher.de

Stand: 20.08.2019 Zum Angebot

Stand: 20.08.2019 Zum Angebot

32,99 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

In Think Complexity, you´ll use graphs, cellular automata, and agent-based models to study topics in physics, biology, and economics. Whether you´re an intermediate-level Python programmer or a student of computational modeling, you´ll delve into examples of complex systems through a series of worked examples, exercises and case studies.

Anbieter: buecher.de

Stand: 20.08.2019 Zum Angebot

Stand: 20.08.2019 Zum Angebot

101,99 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

In Distributed Algorithms , Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. The material is organized according to the system model-first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.

Anbieter: buecher.de

Stand: 20.08.2019 Zum Angebot

Stand: 20.08.2019 Zum Angebot

48,99 € *

ggf. zzgl. Versand

ggf. zzgl. Versand

This book constitutes the refereed proceedings of the 17th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2019, held in Amsterdam, The Netherlands, in August 2019. The 15 full papers and 2 short papers presented in this volume were carefully reviewed and selected from 42 submissions. The papers are organized in the following topical sections: special session on data-driven and stochastic approaches to real-time, including monitoring and Big Data; timed systems; linear and non-linear systems; timed automata; special session on timed systems and probabilities.

Anbieter: buecher.de

Stand: 22.08.2019 Zum Angebot

Stand: 22.08.2019 Zum Angebot

5,19 € *

zzgl. 3,99 € Versand

zzgl. 3,99 € Versand

Anbieter: reBuy.de

Stand: 22.08.2019 Zum Angebot

Stand: 22.08.2019 Zum Angebot