Presents an introduction to the basic models of computability to the undergraduate students. This book deals with Finite Automata and their properties. It provides a class of models and enables the analysis of context-free languages.
This book deals with a fascinating and important subject which has the
fundamentals of computer...
Hypercomputation is a relatively new theory of computation that is about computing methods and devices that transcend the so-called Church-Turing thesis. This book will provide a thorough description of the field of hypercomputation covering all attempts at devising conceptual hypermachines and all new promising computational paradigms that may...
This lively introduction to mathematical logic, easily accessible to non-mathematicians, offers an historical survey, coverage of predicate calculus, model theory, Godel’s theorems, computability and recursivefunctions, consistency and independence in axiomatic set theory, and much more. Suggestions for Further Reading. Diagrams. ...
This volume presents the written versions of the tutorial lectures given at the Workshop on Computational Prospects of Infinity, held from 18 June to 15 August 2005 at the Institute for Mathematical Sciences, National University of Singapore. It consists of articles by four of the leading experts in recursion theory (computability theory) and set...
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...
The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although...
This book focuses on key theoretical topics of computing, in particular formal
languages and abstract machines. It is intended primarily to support the theoretical
modules on a computer science or computing-related undergraduate degree
scheme.
Though the book is primarily theoretical in nature, it attempts to avoid the...
In several practical circumstances we have to solve a problem whose instance
is not a priori completely known. Situations of this kind occur in computer
systems and networks management, in financial decision making, in robotics etc.
Problems that have to be solved without a complete knowledge of the instance
are called on-line...
These proceedings contain the papers that were presented at the 5th International
Conference on Language and Automata Theory and Applications (LATA
2011), held in Tarragona, Spain, during May 26–31, 2011.
The scope of LATA is rather broad, including: algebraic language theory;
algorithms for semi-structured...
To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and...
This book provides an elementary introduction to formal languages and machine computation. The materials covered include computation-oriented mathematics, finite automata and regular languages, push-down automata and context-free languages, Turing machines and recursively enumerable languages, and computability and complexity. As integers are...
This comprehensive compendium of algorithms and data structures covers many theoretical issues from a practical perspective. Chapters include information on finite precision issues as well as discussions on specific algorithms where algorithmic techniques are of special importance - for example, algorithms for drawing graphs, algorithms for...
