Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2014

Automata, Languages, and Programming

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

Editors:

  1. Javier Esparza

    1. Institut für Informatik, Technische Universität München, München, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Pierre Fraigniaud

    1. LIAFA, Université Paris Diderot-Paris 7, Paris Cedex 13, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Thore Husfeldt

    1. IT University of Copenhagen, Copenhagen, Denmark

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Elias Koutsoupias

    1. Department Computer Science, University of Oxford, Oxford, UK,

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8573)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ICALP: International Colloquium on Automata, Languages, and Programming

Conference proceedings info: ICALP 2014.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (49 papers)

  1. Front Matter

    PDF

  2. Track B: Logic, Semantics, Automata, and Theory of Programming

    1. Symmetric Groups and Quotient Complexity of Boolean Operations

      • Jason Bell, Janusz Brzozowski, Nelma Moreira, Rogério Reis
      Pages 1-12

    2. Handling Infinitely Branching WSTS

      • Michael Blondin, Alain Finkel, Pierre McKenzie
      Pages 13-25

    3. Transducers with Origin Information

      • Mikołaj Bojańczyk
      Pages 26-37

    5. On the Decidability of MSO+U on Infinite Trees

      • Mikołaj Bojańczyk, Tomasz Gogacz, Henryk Michalewski, Michał Skrzypczak
      Pages 50-61

    6. A Coalgebraic Foundation for Coinductive Union Types

      • Marcello Bonsangue, Jurriaan Rot, Davide Ancona, Frank de Boer, Jan Rutten
      Pages 62-73

    7. Turing Degrees of Limit Sets of Cellular Automata

      • Alex Borello, Julien Cervelle, Pascal Vanier
      Pages 74-85

    8. On the Complexity of Temporal-Logic Path Checking

      • Daniel Bundala, Joël Ouaknine
      Pages 86-97

    9. Parameterised Linearisability

      • Andrea Cerone, Alexey Gotsman, Hongseok Yang
      Pages 98-109

    10. Games with a Weak Adversary

      • Krishnendu Chatterjee, Laurent Doyen
      Pages 110-121

    11. The Complexity of Ergodic Mean-payoff Games

      • Krishnendu Chatterjee, Rasmus Ibsen-Jensen
      Pages 122-133

    13. Unary Pushdown Automata and Straight-Line Programs

      • Dmitry Chistikov, Rupak Majumdar
      Pages 146-157

    14. Robustness against Power is PSpace-complete

      • Egor Derevenetc, Roland Meyer
      Pages 158-170

    15. A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic

      • Manfred Droste, Vitaly Perevoshchikov
      Pages 171-182

    16. Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs

      • Yuval Emek, Jochen Seidel, Roger Wattenhofer
      Pages 183-195

    17. Coalgebraic Weak Bisimulation from Recursive Equations over Monads

      • Sergey Goncharov, Dirk Pattinson
      Pages 196-207

    19. Between Linearizability and Quiescent Consistency

      • Radha Jagadeesan, James Riely
      Pages 220-231
Back to top

Other Volumes

  1. Automata, Languages, and Programming

  2. Automata, Languages, and Programming

Back to top

About this book

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.
Back to top

Keywords

Back to top

Editors and Affiliations

  • Institut für Informatik, Technische Universität München, München, Germany

    Javier Esparza

  • LIAFA, Université Paris Diderot-Paris 7, Paris Cedex 13, France

    Pierre Fraigniaud

  • IT University of Copenhagen, Copenhagen, Denmark

    Thore Husfeldt

  • Department Computer Science, University of Oxford, Oxford, UK,

    Elias Koutsoupias

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation