Learn IT - Books tags automata

Parallel Complexity Theory (Research Notes in Theoretical Computers Science)

John Wiley & Sons, 1987

Parallel complexity theory, the study of resource-bounded parallel computation, is surely one of the fastest-growing areas of theoretical Computer Science. In the light of this, it would be foolish to attempt an encyclopedic coverage of the field. However, it is the belief of the author that its foundations are becoming increas ingly...

Knowledge-Based Neurocomputing

MIT Press, 2000

Neurocomputing methods are loosely based on a model of the brain as a network of simple interconnected processing elements corresponding to neurons. These methods derive their power from the collective processing of artificial neurons, the chief advantage being that such systems can learn and adapt to a changing environment. In knowledge-based...

Natural Computing: 4th International Workshop on Natural Computing

Springer, 2010

The complex behavior of systems in nature is rooted in intricate mechanisms of interaction that often supersede human-made systems in terms of reliability, power efficiency, and computational capacity. Researchers have begun to realize that natural systems are a great source of inspiration for novel algorithms in computation and communication...

Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

Springer, 2005

In the world we live in concurrency is the norm. For example, the human body
is a massively concurrent system, comprising a huge number of cells, all simultaneously
evolving and independently engaging in their individual biological
processing. In addition, in the biological world, truly sequential systems rarely
arise. However,...

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

Foundations of Computing

Thomson Delmar Learning, 1997

It may sound surprising that in computing, a field which develops so fast that the future often becomes the past without having been the present, there is nothing more stable and worthwhile learning than its foundations.

It may sound less surprising that in a field with such a revolutionary methodological impact on all sciences and...

Mathematical Models of Spoken Language

John Wiley & Sons, 2003

Humans use language to convey meaningful messages to each other. Linguistic competence consists in the ability to express meaning reliably, not simply to obtain faithful lexical transcriptions. This invaluable reference tool is the product of many years' experience and research on language and speech technology. It presents the motivations for,...

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

Cellular Automata and Discrete Complex Systems: 19th International Workshop, AUTOMATA 2013, Gießen, Germany, September 14-19, 2013, Proceedings (Lecture Notes in Computer Science)

Springer, 2013

The volume LNCS 8155 constitutes the refereed proceedings of the 19th International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2013, held in Giessen, Germany, in September 2013. The 8 papers presented were carefully reviewed and selected from 26 submissions. The scope of the workshop spans the following areas the...

Algebraic Theory of Automata Networks (SIAM Monographs on Discrete Mathematics and Applications, 11)

SIAM, 2004

This self-contained monograph covers the foundations of what is currently known about automata networks, giving the reader sufficient theoretical background to be at the forefront of research in many related areas. Alexandra Kireeva, Mathematical Reviews

Algebraic Theory of Automata Networks investigates automata networks as...

Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms (Princeton Series in Applied Mathematics)

Princeton Press, 2009

This book covers its subject very thoroughly. The framework the authors have established is very elegant and, if it catches on, this book could be the primary reference for this approach. I don't know of any other book that covers this set of topics.
(Richard M. Murray, California Institute of Technology )

This...

Introduction to Information Theory and Data Compression, Second Edition

CRC Press, 2003

An effective blend of carefully explained theory and practical applications, this text imparts the fundamentals of both information theory and data compression. Although the two topics are related, this unique text allows either topic to be presented independently, and it was specifically designed so that the data compression section requires...

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