↓ 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 Towards the Graph Minor Theorems for Directed Graphs
  3. Altmetric Badge
    Chapter 2 Automated Synthesis of Distributed Controllers
  4. Altmetric Badge
    Chapter 3 Games for Dependent Types
  5. Altmetric Badge
    Chapter 4 Short Proofs of the Kneser-Lovász Coloring Principle
  6. Altmetric Badge
    Chapter 5 Provenance Circuits for Trees and Treelike Instances
  7. Altmetric Badge
    Chapter 6 Language Emptiness of Continuous-Time Parametric Timed Automata
  8. Altmetric Badge
    Chapter 7 Analysis of Probabilistic Systems via Generating Functions and Padé Approximation
  9. Altmetric Badge
    Chapter 8 On Reducing Linearizability to State Reachability
  10. Altmetric Badge
    Chapter 9 The Complexity of Synthesis from Probabilistic Components
  11. Altmetric Badge
    Chapter 10 Edit Distance for Pushdown Automata
  12. Altmetric Badge
    Chapter 11 Solution Sets for Equations over Free Groups are EDT0L Languages
  13. Altmetric Badge
    Chapter 12 Limited Set quantifiers over Countable Linear Orderings
  14. Altmetric Badge
    Chapter 13 Reachability is in DynFO
  15. Altmetric Badge
    Chapter 14 Natural Homology
  16. Altmetric Badge
    Chapter 15 Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
  17. Altmetric Badge
    Chapter 16 Trading Bounds for Memory in Games with Counters
  18. Altmetric Badge
    Chapter 17 Decision Problems of Tree Transducers with Origin
  19. Altmetric Badge
    Chapter 18 Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words
  20. Altmetric Badge
    Chapter 19 The Odds of Staying on Budget
  21. Altmetric Badge
    Chapter 20 From Sequential Specifications to Eventual Consistency
  22. Altmetric Badge
    Chapter 21 Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
  23. Altmetric Badge
    Chapter 22 An Algebraic Geometric Approach to Nivat’s Conjecture
  24. Altmetric Badge
    Chapter 23 Nominal Kleene Coalgebra
  25. Altmetric Badge
    Chapter 24 On Determinisation of Good-for-Games Automata
  26. Altmetric Badge
    Chapter 25 Owicki-Gries Reasoning for Weak Memory Models
  27. Altmetric Badge
    Chapter 26 On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
  28. Altmetric Badge
    Chapter 27 Compressed Tree Canonization
  29. Altmetric Badge
    Chapter 28 Parsimonious Types and Non-uniform Computation
  30. Altmetric Badge
    Chapter 29 Baire Category Quantifier in Monadic Second Order Logic
  31. Altmetric Badge
    Chapter 30 Liveness of Parameterized Timed Networks
  32. Altmetric Badge
    Chapter 31 Symmetric Strategy Improvement
  33. Altmetric Badge
    Chapter 32 Effect Algebras, Presheaves, Non-locality and Contextuality
  34. Altmetric Badge
    Chapter 33 On the Complexity of Intersecting Regular, Context-Free, and Tree Languages
  35. Altmetric Badge
    Chapter 34 Containment of Monadic Datalog Programs via Bounded Clique-Width
  36. Altmetric Badge
    Chapter 35 An Approach to Computing Downward Closures
  37. Altmetric Badge
    Chapter 36 How Much Lookahead is Needed to Win Infinite Games?
  38. Altmetric Badge
    Chapter 37 Symmetric Graph Properties Have Independent Edges
  39. Altmetric Badge
    Chapter 38 Polylogarithmic-Time Leader Election in Population Protocols
  40. Altmetric Badge
    Chapter 39 Core Size and Densification in Preferential Attachment Networks
  41. Altmetric Badge
    Chapter 40 Maintaining Near-Popular Matchings
  42. Altmetric Badge
    Chapter 41 Ultra-Fast Load Balancing on Scale-Free Networks
  43. Altmetric Badge
    Chapter 42 Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
  44. Altmetric Badge
    Chapter 43 The Range of Topological Effects on Communication
  45. Altmetric Badge
    Chapter 44 Secretary Markets with Local Information
  46. Altmetric Badge
    Chapter 45 A Simple and Optimal Ancestry Labeling Scheme for Trees
  47. Altmetric Badge
    Chapter 46 Interactive Communication with Unknown Noise Rate
  48. Altmetric Badge
    Chapter 47 Fixed Parameter Approximations for k -Center Problems in Low Highway Dimension Graphs
  49. Altmetric Badge
    Chapter 48 A Unified Framework for Strong Price of Anarchy in Clustering Games
  50. Altmetric Badge
    Chapter 49 On the diameter of hyperbolic random graphs
  51. Altmetric Badge
    Chapter 50 Tight Bounds for Cost-Sharing in Weighted Congestion Games
  52. Altmetric Badge
    Chapter 51 Distributed Broadcast Revisited: Towards Universal Optimality
  53. Altmetric Badge
    Chapter 52 Selling Two Goods Optimally
  54. Altmetric Badge
    Chapter 53 Adaptively Secure Coin-Flipping, Revisited
  55. Altmetric Badge
    Chapter 54 Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem
  56. Altmetric Badge
    Chapter 55 Normalization Phenomena in Asynchronous Networks
  57. Altmetric Badge
    Chapter 56 Broadcast from Minicast Secure Against General Adversaries
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
twitter
7 X users
wikipedia
1 Wikipedia page

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
15 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 2015
DOI 10.1007/978-3-662-47666-6
ISBNs
978-3-66-247665-9, 978-3-66-247666-6
Editors

Halldórsson, Magnús M., Iwama, Kazuo, Kobayashi, Naoki, Speckmann, Bettina

X Demographics

X Demographics

The data shown below were collected from the profiles of 7 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 15 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 1 7%
Other 1 7%
Unknown 13 87%
Readers by discipline Count As %
Computer Science 2 13%
Unknown 13 87%