The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one...

This volume presents the papers selected for the Symposium Logic at Tver '92, held at Sokol, near Tver, Russia in July 1992. It is the second in a series of international symposia on logical foundations of computer science held in Russia. The meeting is a joint efort of scholars from both the former Soviet Union and the West, and indicates a new era of international co-operation. Sponsors of the meeting include: the Association for Computing Machinery, the Association for Symbolic Logic, and the Committee on Mathematical Foundations of Computer Science of IEEE. The book is a unique source of...

This volume contains the revised refereed papers accepted for presentation at the Third International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR '95, held in Lexington, KY, USA in June 1995 under the sponsorship of the Association for Logic Programming.
The LPNMR conferences bring together researchers from logic programming and the logical foundations of artificial intelligence in order to facilitate cooperation and cross-fertilization of ideas. The 28 full papers presented define the state of the art in this interdisciplinary area of research, which has recently...

This book documents the scientific outcome of the Third International Workshop on Hybrid Systems, held in Ithaca, NY, USA, in October 1994. It presents a selection of carefully reviewed and revised full papers chosen from the workshop contribution and is the successor to LNCS 736, the seminal "Hybrid Systems" volume edited by Grossman, Nerode, Ravn, and Rischel.
Hybrid systems are models for networks of digital and continuous devices, in which digital control programs sense and supervise continuous and discrete plants governed by differential or difference equations. The investigation of...

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2013, held in San Diego, CA, USA in January 2013. The volume presents 29 revised refereed papers carefully selected by the program committee. The scope of the Symposium is broad and includes constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem...