↓ Skip to main content

Automata, Languages, and Programming

Overview of attention for book
Cover of 'Automata, Languages, and Programming'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Symmetric Groups and Quotient Complexity of Boolean Operations
  3. Altmetric Badge
    Chapter 2 Handling Infinitely Branching WSTS
  4. Altmetric Badge
    Chapter 3 Transducers with Origin Information
  5. Altmetric Badge
    Chapter 4 Weak MSO+U with Path Quantifiers over Infinite Trees
  6. Altmetric Badge
    Chapter 5 On the Decidability of MSO+U on Infinite Trees
  7. Altmetric Badge
    Chapter 6 A Coalgebraic Foundation for Coinductive Union Types
  8. Altmetric Badge
    Chapter 7 Turing Degrees of Limit Sets of Cellular Automata
  9. Altmetric Badge
    Chapter 8 On the Complexity of Temporal-Logic Path Checking
  10. Altmetric Badge
    Chapter 9 Parameterised Linearisability
  11. Altmetric Badge
    Chapter 10 Games with a Weak Adversary
  12. Altmetric Badge
    Chapter 11 The Complexity of Ergodic Mean-payoff Games
  13. Altmetric Badge
    Chapter 12 Toward a Structure Theory of Regular Infinitary Trace Languages
  14. Altmetric Badge
    Chapter 13 Unary Pushdown Automata and Straight-Line Programs
  15. Altmetric Badge
    Chapter 14 Robustness against Power is PSpace-complete
  16. Altmetric Badge
    Chapter 15 A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
  17. Altmetric Badge
    Chapter 16 Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs
  18. Altmetric Badge
    Chapter 17 Coalgebraic Weak Bisimulation from Recursive Equations over Monads
  19. Altmetric Badge
    Chapter 18 Piecewise Boolean Algebras and Their Domains
  20. Altmetric Badge
    Chapter 19 Between Linearizability and Quiescent Consistency
  21. Altmetric Badge
    Chapter 20 Bisimulation Equivalence of First-Order Grammars
  22. Altmetric Badge
    Chapter 21 Context Unification is in PSPACE
  23. Altmetric Badge
    Chapter 22 Monodic Fragments of Probabilistic First-Order Logic
  24. Altmetric Badge
    Chapter 23 Stability and Complexity of Minimising Probabilistic Automata
  25. Altmetric Badge
    Chapter 24 Kleene Algebra with Equations
  26. Altmetric Badge
    Chapter 25 All–Instances Termination of Chase is Undecidable
  27. Altmetric Badge
    Chapter 26 Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus
  28. Altmetric Badge
    Chapter 27 On the Positivity Problem for Simple Linear Recurrence Sequences ,
  29. Altmetric Badge
    Chapter 28 Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
  30. Altmetric Badge
    Chapter 29 Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
  31. Altmetric Badge
    Chapter 30 Hardness Results for Intersection Non-Emptiness
  32. Altmetric Badge
    Chapter 31 Branching Bisimilarity Checking for PRS
  33. Altmetric Badge
    Chapter 32 Labeling Schemes for Bounded Degree Graphs
  34. Altmetric Badge
    Chapter 33 Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints
  35. Altmetric Badge
    Chapter 34 Distributed Computing on Core-Periphery Networks: Axiom-Based Design
  36. Altmetric Badge
    Chapter 35 Fault-Tolerant Rendezvous in Networks
  37. Altmetric Badge
    Chapter 36 Data Delivery by Energy-Constrained Mobile Agents on a Line
  38. Altmetric Badge
    Chapter 37 Automata, Languages, and Programming
  39. Altmetric Badge
    Chapter 38 Jamming-Resistant Learning in Wireless Networks
  40. Altmetric Badge
    Chapter 39 Facility Location in Evolving Metrics
  41. Altmetric Badge
    Chapter 40 Solving the ANTS Problem with Asynchronous Finite State Machines
  42. Altmetric Badge
    Chapter 41 Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
  43. Altmetric Badge
    Chapter 42 Randomized Rumor Spreading in Dynamic Graphs
  44. Altmetric Badge
    Chapter 43 Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
  45. Altmetric Badge
    Chapter 44 Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems
  46. Altmetric Badge
    Chapter 45 Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
  47. Altmetric Badge
    Chapter 46 Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
  48. Altmetric Badge
    Chapter 47 The Melbourne Shuffle: Improving Oblivious Storage in the Cloud
  49. Altmetric Badge
    Chapter 48 Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems
  50. Altmetric Badge
    Chapter 49 Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
3 tweeters

Readers on

mendeley
3 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Automata, Languages, and Programming
Published by
Springer Berlin Heidelberg, June 2014
DOI 10.1007/978-3-662-43951-7
ISBNs
978-3-66-243950-0, 978-3-66-243951-7
Editors

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

Twitter Demographics

The data shown below were collected from the profiles of 3 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 67%
Student > Master 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Engineering 1 33%