Learn IT - Books tags automata

Systematic Design for Emergence in Cellular Nonlinear Networks: With Applications in Natural Computing and Signal Processing-

Springer, 2008

The main problem addressed in this book came out during a Fulbright research fellowship stage at U.C. Berkeley (California, USA, 1996–1998). Then, I had the opportunity to work in the research group of Leon Chua on a subject called CNN (cellular neural/nonlinear network). The CNN, developed in the end of the 1980s was an important step ahead...

Data Streams: Algorithms and Applications (Foundations and Trends in Theoretical Computer Science)

Now Publishers, 2005

Data stream algorithms as an active research agenda emerged only over the past few years, even though the concept of making few passes over the data for performing computations has been around since the early days of Automata Theory. The data stream agenda now pervades many branches of Computer Science including databases, networking, knowledge...

Programming Language Pragmatics, Second Edition

Morgan Kaufmann, 2005

"Michael Scott's book could have been entitled: Why Programming Languages Work. It takes a fresh look at programming languages by bringing together ideas and techniques usually covered in disparate language design, compiler, computer architecture, and operating system courses. Its comprehensive and integrated presentation of language...

Formal Techniques for Networked and Distributed Systems (IFIP International Federation for Information Processing)

Springer, 2001

This book presents the latest worldwide results in theory and practice of formal techniques for networked and distributed systems. The theme of the book is addressed by specialized papers in the following areas:

Formal Methods in Software Development,

Process Algebra,

Timed Automata,

...

Principles of Model Checking

MIT Press, 2008

Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms, techniques, and tools for assessing functional properties of these systems. One such technique that has emerged in the last twenty years is model checking, which systematically (and automatically) checks whether a model of a...

Mathematical Foundations of Computer Science 2008: 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings

Springer, 2008

This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008.

The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical...

Formal Modeling and Analysis of Timed Systems: 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008, Proceedings

Springer, 2008

This volume consists of the proceedings of the Sixth International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS 2008). The main goal of this series of conferences is to bring together diverse communities of researchers that deal with the timing aspects of computing systems. Both fundamental and practical aspects of timed...

Automated Reasoning: 4th International Joint Conference, IJCAR 2008, Sydney, NSW, Australia, August 12-15, 2008, Proceedings

Springer, 2008

This book constitutes the refereed proceedings of the 4th International Joint Conference on Automated Reasoning, IJCAR 2008, held in Sydney, Australia, in August 2008. The 26 revised full research papers and 13 revised system descriptions presented together with 4 invited papers and a summary of the CASC-J4 systems competition were carefully...

STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings

Springer, 2007

This book constitutes the refereed proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, held in Aachen, Germany in February 2007.

The 56 revised full papers presented together with 3 invited papers were carefully reviewed and selected from about 400 submissions. The papers address the whole range of...

An Introduction to Formal Languages and Automata

Jones and Bartlett Publishers, 2000

This text covers all the material essential to an introductory theory of computation course for undergraduate students. The text has a solid mathematical base, and provides precise mathematical statements of theorems and definitions, giving an intuitive motivation for constructions and proofs. Proofs and arguments are clearly stated, without...

Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems)

Morgan Kaufmann, 1997

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...

Linknot: Knot Theory by Computer (Series on Knots and Everything)

World Scientific Publishing, 2007

LinKnot Knot Theory by Computer provides a unique view of selected topics in knot theory suitable for students, research mathematicians, and readers with backgrounds in other exact sciences, including chemistry, molecular biology and physics. The book covers basic notions in knot theory, as well as new methods for handling open problems such as...

Result Page: 10 9 8 7 6 5 4 3 2 1