Volker Diekert

Dirk Nowotka

This book constitutes the proceedings of the 13th International Conference, DLT 2009, held in Stuttgart, Germany from June 30 until July 3, 2009. The 35 papers presented together with 4 invited talks were carefully reviewed and selected from 70 submissions. The papers presented address topics on formal languages, automata theory, computability, complexity, logic, petri nets and related areas.

13th International Conference, DLT 2009, Stuttgart, Germany, June 30--July 3, 2009, Proceedings

Developments in Language Theory

Bruno Durand

This book constitutes the refereed proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005, held in Stuttgart, Germany in February 2005. The 54 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 217 submissions. A broad variety of topics from theoretical computer science are addressed, in particular complexity theory, algorithmics, computational discrete mathematics, automata theory, combinatorial optimization and approximation, networking and graph theory, computational geometry, grammar systems and formal languages, etc.

22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2004, Proceedings

STACS 2005

Andrei Voronkov

Mikhail Volkov

This book features the refereed proceedings of the 2nd International Symposium on Computer Science in Russia held in September 2007. The 35 papers cover theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory; and applications of logic to computer science. Many applications are presented.

Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings

Computer Science - Theory and Applications

The construction of a software system is a task that has to be structured toensure that the software product fulfills all expectations and the process of producing it remains manageable and reliable. Mathematical methods, including logic, algebra and functional calculus, are needed to support structuring and provide notations and basic formal concepts for the foundations of software engineering. Mathematical methods of programming reflect the need for modularization and abstraction and suggest appropriate goal-directed procedures for the construction of software programs. This volume contains the proceedings of an International Summer School held at Marktoberdorf in 1990, the 11th in a series on mathematical methods in programming. Outstanding scientists contributed papers centered around logical and functional calculi for the specification, refinement and verification of programs and program systems, and remarkable examples for the formal development of proofs and algorithms are given.

Combinatorics on Traces

Karsten Weicker

Nicole Weicker

Festschrift für Volker Claus zum 65. Geburtstag

Informatik als Dialog zwischen Theorie und Anwendung

Grzegorz Rozenberg

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.

Volker Diekert

About

Books

Join the club