Automata, Languages and Programming

24th International Colloquium, ICALP'97, Bologna, Italy, July 7 - 11, 1997, Proceedings

Author: Pierpaolo Degano

Publisher: Springer Science & Business Media

ISBN:

Category: Computers

Page: 862

View: 461

This book constitutes the refereed proceedings of the 24th International Colloquium on Automata, Languages and Programming, ICALP '97, held in Bologna, Italy, in July 1997. ICALP '97 celebrated the 25th anniversary of the European Association for Theoretical Computer Science (EATCS), which has sponsored the ICALP meetings since 1972. The volume presents 73 revised full papers selected from a total of 197 submissions. Also included are six invited contributions. ICALP is one of the few flagship conferences in the area. The book addresses all current topics in theoretical computer science.

Automata, Languages and Programming

27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings

Author: Ugo Montanari

Publisher: Springer

ISBN:

Category: Computers

Page: 952

View: 814

This book constitutes the refereed proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, held in Geneva, Switzerland in July 2000. The 69 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 196 extended abstracts submitted for the two tracks on algorithms, automata, complexity, and games and on logic, semantics, and programming theory. All in all, the volume presents an unique snapshot of the state-of-the-art in theoretical computer science.

Automata, Languages and Programming

37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II

Author: Samson Abramsky

Publisher: Springer

ISBN:

Category: Computers

Page: 614

View: 947

Annotation The two-volume set LNCS 6198 and LNCS 6199 constitutes the refereed proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, held in Bordeaux, France, in July 2010. The 106 revised full papers (60 papers for track A, 30 for track B, and 16 for track C) presented together with 6 invited talks were carefully reviewed and selected from a total of 389 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 6199 contains 46 contributions of track B and C selected from 167 submissions as well as 4 invited talks.

Computational Complexity Theory

Author: Juris Hartmanis

Publisher: American Mathematical Soc.

ISBN:

Category: Mathematics

Page: 128

View: 868

Computational complexity theory is the study of the quantitative laws that govern computing. During the last 25 years, this field has grown into a rich mathematical theory. Currently one of the most active research areas in computer science, complexity theory is of considerable interest to mathematicians as well, since some of the key open problems in this field raise basic questions about the nature of mathematics. Many experts in complexity theory believe that, in coming decades, the strongest influence on the development of mathematics will come from the extended use of computing and from concepts and problems arising in computer science.This volume contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988. The purpose of the short course was to provide an overview of complexity theory and to describe some of the current developments in the field. The papers presented here represent contributions by some of the top experts in this burgeoning area of research.

Werkzeuge der Programmiertechnik

GI-Arbeitstagung Karlsruhe, 16.–17. März 1981. Proceedings

Author: G. Goos

Publisher: Springer-Verlag

ISBN:

Category: Computers

Page: 262

View: 228

Problem Solving in Automata, Languages, and Complexity

Author: Ding-Zhu Du

Publisher: John Wiley & Sons

ISBN:

Category: Computers

Page: 408

View: 510

Automata and natural language theory are topics lying at the heart of computer science. Both are linked to computational complexity and together, these disciplines help define the parameters of what constitutes a computer, the structure of programs, which problems are solvable by computers, and a range of other crucial aspects of the practice of computer science. In this important volume, two respected authors/editors in the field offer accessible, practice-oriented coverage of these issues with an emphasis on refining core problem solving skills.

Automata, Languages and Programming

2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974. Proceedings

Author: J. Loeckx

Publisher: Springer

ISBN:

Category: Computers

Page: 612

View: 862

The Second Colloquium on Automata, Languages and Programming is the successor of a similar Colloquium organized by IRIA in Paris, July 3-7, 1972. The present Colloquium which takes place at the Unl- versity of Saarbrucken from July 29th to August 2nd, 1974, is spon sored by the Gesellschaft fur. Informatik and organized in cooperation wlth the Special Interest Group on Automata and Computability Theory (SIGACT) and with the European Association for Theoretical Computer Science (EATCS). As its predecessor the present Colloquium is devoted to the theo retical bases of computer science. This volume contains the text of the different lectures of the Colloquium whlch have been selected by the Program Committee out of about 130 submitted papers. About one third of the papers of this volume is concerned with formal language theory, one other third with the theory of computation and the rest with complexity theory, automata theory, programming languages, etc.

The Book of Traces

Author: V Diekert

Publisher: World Scientific

ISBN:

Category: Computers

Page: 568

View: 120

The theory of traces employs techniques and tackles problems from quite diverse areas which include formal language theory, combinatorics, graph theory, algebra, logic, and the theory of concurrent systems. In all these areas the theory of traces has led to interesting problems and significant results. It has made an especially big impact in formal language theory and the theory of concurrent systems. In both these disciplines it is a well-recognized and dynamic research area. Within formal language theory it yields the theory of partially commutative monoids, and provides an important connection between languages and graphs. Within the theory of concurrent systems it provides an important formal framework for the analysis and synthesis of concurrent systems. This monograph covers all important research lines of the theory of traces; each chapter is devoted to one research line and is written by leading experts. The book is organized in such a way that each chapter can be read independently — and hence it is very suitable for advanced courses or seminars on formal language theory, the theory of concurrent systems, the theory of semigroups, and combinatorics. An extensive bibliography is included. At present, there is no other book of this type on trace theory. Contents:Basic Notions:Introduction to Trace Theory (A Mazurkiewicz)Dependence Graphs (H J Hoogeboom & G Rozenberg)Algebra and Combinatorics:Combinatorics in Trace Monoids I (C Choffrut)Combinatorics in Trace Monoids II (G Duchamp & D Krob)Counting Techniques for Inclusion, Equivalence and Membership Problems (A Bertoni et al.)Languages and Automata:Recognizable Trace Languages (E Ochma(ski)Asynchronous Automata (W Zielonka)Construction of Asynchronous Automata (V Diekert & A Mischoll)Concurrency and Logic:Trace Structures and Other Models for Concurrency (M Nielsen & G Winskel)Traces and Logic (W Penczek & R Kuiper)Generalizations:Infinite Traces (P Gastin & A Petit)Semi-Commutations (M Clerbout et al.) Readership: Computer scientists and mathematicians. keywords:Traces;Concurrency;Partial Commutation;Automata;Formal Languages;Mathematical Foundations of Computer Science;Infinite Behaviour