Counter-free automata

Author: Robert McNaughton,Seymour Papert
Publisher: The MIT Press
Category: Computers
Page: 163
View: 2925

Continue Reading →

A particular class of finite-state automata, christened by the authors &"counter-free,&" is shown here to behave like a good actor: it can drape itself so thoroughly in the notational guise and embed itself so deeply in the conceptual character of several quite different approaches to automata theory that on the surface it is hard to believe that all these roles are being assumed by the same class. This is one of the reasons it has been chosen for study here. The authors write that they &"became impressed with the richness of its mathematical complexity&" and that &"a sure sign of gold is when profound mathematical theory interacts with problems that arise independently. And indeed it is noteworthy that the class of automata we shall discuss was defined more or less explicitly by several people working from very different directions and using very different concepts. The remarkable happening was that these definitions could not be recognized as equivalent until algebraic tools of analysis were brought to the field in the works of Schutzenberger and in the works of Krohn and Rhodes.&" The theme of the monograph is the utility and equivalence of these different definitions of counter-free automata. Its organization follows the plan of taking up, one by one, each of a number of different conceptualizations: the historically important &"nerve net&" approach; the algebraic approach, in which automata are treated as semigroups; the &"classical&" theory based on state transition diagrams; the &"linguistic&" approach based on the concept of regular expressions; and the &"behavioral&" descriptions using symbolic logic. In each of these conceptual areas, the class of automata under study is found in a new guise. Each time it appears as yet another special case. The authors' burden is to show that all these definitions are in fact equivalent. Care has been taken so that this research monograph can be used as a self-sufficient text. Notations have been defined carefully and always in the context of the discussion. Most of the chapters end with a substantial number of exercises. It is self-contained in that all concepts are defined, and all theorems used are, with one exception, either fully proved or safely left as exercises for the student.

Logic and Automata

History and Perspectives
Author: Jörg Flum,Erich Grädel,Thomas Wilke
Publisher: Amsterdam University Press
ISBN: 9053565760
Category: Mathematics
Page: 736
View: 5191

Continue Reading →

Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d’horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field.

Logic and Algebra of Specification

Author: Friedrich L. Bauer,Wilfried Brauer,Helmut Schwichtenberg
Publisher: Springer Science & Business Media
ISBN: 3642580416
Category: Computers
Page: 442
View: 2084

Continue Reading →

For some years, specification of software and hardware systems has been influenced not only by algebraic methods but also by new developments in logic. These new developments in logic are partly based on the use of algorithmic techniques in deduction and proving methods, but are alsodue to new theoretical advances, to a great extent stimulated by computer science, which have led to new types of logic and new logical calculi. The new techniques, methods and tools from logic, combined with algebra-based ones, offer very powerful and useful tools for the computer scientist, which may soon become practical for commercial use, where, in particular, more powerful specification tools are needed for concurrent and distributed systems. This volume contains papers based on lectures by leading researchers which were originally given at an international summer school held in Marktoberdorf in 1991. The papers aim to give a foundation for combining logic and algebra for the purposes of specification under the aspects of automated deduction, proving techniques, concurrency and logic, abstract data types and operational semantics, and constructive methods.

Formal Modeling and Analysis of Timed Systems

5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings
Author: Jean-Francois Raskin
Publisher: Springer Science & Business Media
ISBN: 3540754539
Category: Computers
Page: 368
View: 1402

Continue Reading →

This book constitutes the refereed proceedings of the 5th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2007, held in Salzburg, Austria, in October 2007. The 22 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 48 submissions. The papers cover work on foundations and semantics of timed systems including timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, and probabilistic models. There are contributions on techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints such as scheduling, worst-case execution time analysis, optimisation, model-checking, testing, constraint solving, etc.; finally there are articles on applications like real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication.

Their Footprints Remain

Biomedical Beginnings Across the Indo-Tibetan Frontier
Author: Alex McKay
Publisher: Amsterdam University Press
ISBN: 9053565183
Category: Medical
Page: 302
View: 9574

Continue Reading →

By the end of the 19th century, British imperial medical officers and Christian medical missionaries had introduced Western medicine to Tibet, Sikkim, and Bhutan. Their Footprints Remain uses archival sources, personal letters, diaries, and oral sources in order to tell the fascinating story of how this once-new medical system became imbedded in the Himalayas. Of interest to anyone with an interest in medical history and anthropology, as well as the Himalayan world, this volume not only identifies the individuals involved and describes how they helped to spread this form of imperialist medicine, but also discusses its reception by a local people whose own medical practices were based on an entirely different understanding of the world.

Finite Automata, Formal Logic, and Circuit Complexity

Author: Howard Straubing
Publisher: Springer Science & Business Media
ISBN: 1461202892
Category: Computers
Page: 227
View: 1612

Continue Reading →

The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com puter science community, which moved to other concerns.

CONCUR 2014 – Concurrency Theory

25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings
Author: Paolo Baldan,University of Roma "La Sapienza"
Publisher: Springer
ISBN: 3662445840
Category: Computers
Page: 594
View: 8456

Continue Reading →

This book constitutes the refereed proceedings of the 25th International Conference on Concurrency Theory, CONCUR 2014, held in Rome, Italy in September 2014. The 35 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 124 submissions. The focus of the conference is on the following topics: process calculi, model checking and abstraction, synthesis, quantitative models, automata and multithreading, complexity, process calculi and types, categories, graphs and quantum systems, automata and time, and games.

Generalized Quantifiers

Linguistic and Logical Approaches
Author: Peter Gärdenfors
Publisher: Springer Science & Business Media
ISBN: 9400933819
Category: Language Arts & Disciplines
Page: 309
View: 2297

Continue Reading →

Some fifteen years ago, research on generalized quantifiers was con sidered to be a branch of mathematical logic, mainly carried out by mathematicians. Since then an increasing number of linguists and philosophers have become interested in exploring the relevance of general quantifiers for natural language as shown by the bibliography compiled for this volume. To a large extent, the new research has been inspired by Jon Barwise and Robin Cooper's path-breaking article "Generalized Quantifiers and Natural Language" from 1981. A concrete sign of this development was the workshop on this topic at Lund University, May 9-11, 1985, which was organized by Robin Cooper, Elisabet Engdahl, and the present editor. All except two of the papers in this volume derive from that workshop. Jon Barwise's paper in the volume is different from the one he presented in connection with the workshop. Mats Rooth's contribution has been added because of its close relationship with the rest of the papers. The articles have been revised for publication here and the authors have commented on each other's contributions in order to integrate the collection. The organizers of the workshop gratefully acknowledge support from the Department of Linguistics, the Department of Philosophy and the Faculty of Humanities at Lund University, the Royal Swedish Academy of Sciences (through the Wallenberg Foundation), the Swedish Institute, and the Letterstedt Foundation.

Mathematical Linguistics

Author: Andras Kornai
Publisher: Springer Science & Business Media
ISBN: 1846289858
Category: Mathematics
Page: 290
View: 4051

Continue Reading →

Mathematical Linguistics introduces the mathematical foundations of linguistics to computer scientists, engineers, and mathematicians interested in natural language processing. The book presents linguistics as a cumulative body of knowledge from the ground up: no prior knowledge of linguistics is assumed. As the first textbook of its kind, this book is useful for those in information science and in natural language technologies.

Trees in Algebra and Programming - CAAP '94

19th International Colloquium, Edinburgh, U.K., April 11 - 13, 1994. Proceedings
Author: Sophie Tison
Publisher: Springer Science & Business Media
ISBN: 9783540578796
Category: Computers
Page: 361
View: 304

Continue Reading →

This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers.

Proceedings of a Conference on Theoretical Computer Science

August 15-17, 1977, University of Waterloo, Waterloo, Ontario, Canada
Author: University of Waterloo. Dept. of Computer Science,University of Waterloo. Mathematical Research Division,University of Waterloo. Division of Mathematical Research
Publisher: N.A
Category: Computational complexity
Page: 283
View: 2527

Continue Reading →

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

24th International Conference, Chennai, India, December 16-18, 2004, Proceedings
Author: Kamal Lodaya,Meena Mahajan
Publisher: Springer
Category: Computers
Page: 532
View: 5086

Continue Reading →

This book constitutes the refereed proceedings of the 24th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004, held in Chennai, India, in December 2004. The 35 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 176 submissions. The papers address a broad variety of current issues in software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics, complexity theory, automata theory, and theoretical computer science in general.