Suggests Automata Theory may be poised for another period of significant advance, similar to that in the 1960s and 1970s. -- Mathematical Reviews, 2002
This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of...
This book provides the reader with an elementary introduction to chaos and fractals, suitable for students with a background in elementary algebra, without assuming prior coursework in calculus or physics. It introduces the key phenomena of chaos - aperiodicity, sensitive dependence on initial conditions, bifurcations - via simple iterated...
While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined – ideally there exist complete precise descriptions of the source and target languages. Additional...
This text is based on two rich sources: (1) materials in lecture notes I taught to senior
and graduate-level computer science and electrical engineering students at Rice University
and at the University of Houston, and (2) my research in the area of timing
analysis and verification of real-time systems since the late 1980s,...
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...
The journal Computing has established a series of supplement volumes the fourth
of which appears this year. Its purpose is to provide a coherent presentation of a
new topic in a single volume. The previous subjects were Computer Arithmetic
1977, Fundamentals of Numerical Computation 1980, and Parallel Processes and
Related Automata...
Programming Language Concepts uses a functional programming language (F#) as the metalanguage in which to present all concepts and examples, and thus has an operational flavour, enabling practical experiments and exercises. It includes basic concepts such as abstract syntax, interpretation, stack machines, compilation, type checking, and...
This volume of Lecture Notes in Computer Science contains revised versions of papers presented at the 15th International Conference on Implementation and Application of Automata, CIAA 2010. The conference was held at the University of Manitoba in Winnipeg, Canada, on August 12–15, 2010. The previous CIAA conferences were held in London,...
Urban development and migration from rural to urban areas are impacting prime agricultural land and natural landscapes, particularly in the less developed countries. These phenomena will persist and require serious study by those monitoring global environmental change. To address this need, various models have been devised to analyze urbanization...
LR parsing has become a widely used method of syntax analysis; this
is largely due to the availability of parser generators and compiler-
compilers based on LR techniques. However, the readily available ac
counts of the theory of these techniques are either superficial or are
weighed down with tedious mathematical detail of a merely...
The Problem of the Unknown Component: Theory and Applications addresses the issue of designing a component that, combined with a known part of a system, conforms to an overall specification. The authors tackle this problem by solving abstract equations over a language. The most general solutions are studied when both synchronous and...
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...
