Automata, Languages, and Programming

41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings

Author: Javier Esparza,Pierre Fraigniaud,Thore Husfeldt,Elias Koutsoupias

Publisher: Springer

ISBN: 3662439514

Category: Computers

Page: 624

View: 6924

DOWNLOAD NOW »

This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.
Release

Classical and New Paradigms of Computation and their Complexity Hierarchies

Papers of the conference "Foundations of the Formal Sciences III"

Author: Benedikt Löwe,Boris Piwinger,Thoralf Räsch

Publisher: Springer Science & Business Media

ISBN: 1402027761

Category: Computers

Page: 260

View: 2321

DOWNLOAD NOW »

The notion of complexity is an important contribution of logic to theoretical computer science and mathematics. This volume attempts to approach complexity in a holistic way, investigating mathematical properties of complexity hierarchies at the same time as discussing algorithms and computational properties. A main focus of the volume is on some of the new paradigms of computation, among them Quantum Computing and Infinitary Computation. The papers in the volume are tied together by an introductory article describing abstract properties of complexity hierarchies. This volume will be of great interest to both mathematical logicians and theoretical computer scientists, providing them with new insights into the various views of complexity and thus shedding new light on their own research.
Release

Advanced Topics in Bisimulation and Coinduction

Author: Davide Sangiorgi,Jan Rutten

Publisher: Cambridge University Press

ISBN: 1139502905

Category: Computers

Page: N.A

View: 1957

DOWNLOAD NOW »

Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material.
Release

Fundamentals of Computation Theory

15th International Symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings

Author: Maciej Liskiewicz

Publisher: Springer Science & Business Media

ISBN: 3540281932

Category: Computers

Page: 576

View: 7330

DOWNLOAD NOW »

This book constitutes the refereed proceedings of the 15th International Symposium Fundamentals of Computation Theory, FCT 2005, held in Lübeck, Germany in August 2005. The 46 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 105 submissions. The papers are organized in topical sections on circuits, automata, complexity, approximability, computational and structural complexity, graphs and complexity, computational game theory, visual cryptography and computational geometry, query complexity, distributed systems, automata and formal languages, semantics, approximation algorithms, average case complexity, algorithms, graph algorithms, and pattern matching.
Release