↓ 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 Informative Labeling Schemes
  3. Altmetric Badge
    Chapter 2 Noetherian Spaces in Verification
  4. Altmetric Badge
    Chapter 3 Towards a Theory of Time-Bounded Verification
  5. Altmetric Badge
    Chapter 4 Physical Algorithms
  6. Altmetric Badge
    Chapter 5 Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
  7. Altmetric Badge
    Chapter 6 Pumping and Counting on the Regular Post Embedding Problem
  8. Altmetric Badge
    Chapter 7 Alternation Removal in Büchi Automata
  9. Altmetric Badge
    Chapter 8 Linear Orders in the Pushdown Hierarchy
  10. Altmetric Badge
    Chapter 9 The Serializability of Network Codes
  11. Altmetric Badge
    Chapter 10 How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
  12. Altmetric Badge
    Chapter 11 Efficient Information Exchange in the Random Phone-Call Model
  13. Altmetric Badge
    Chapter 12 An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines
  14. Altmetric Badge
    Chapter 13 A Topological Approach to Recognition
  15. Altmetric Badge
    Chapter 14 On LR(k)-Parsers of Polynomial Size
  16. Altmetric Badge
    Chapter 15 Automata, Languages and Programming
  17. Altmetric Badge
    Chapter 16 Game Semantics for Call-by-Value Polymorphism
  18. Altmetric Badge
    Chapter 17 What Is a Pure Functional?
  19. Altmetric Badge
    Chapter 18 Example-Guided Abstraction Simplification
  20. Altmetric Badge
    Chapter 19 Compositional Closure for Bayes Risk in Probabilistic Noninterference
  21. Altmetric Badge
    Chapter 20 Asynchronous Throughput-Optimal Routing in Malicious Networks
  22. Altmetric Badge
    Chapter 21 Improved Fault Tolerance and Secure Computation on Sparse Networks
  23. Altmetric Badge
    Chapter 22 Sparse Reliable Graph Backbones
  24. Altmetric Badge
    Chapter 23 Approximation Algorithms for Diversified Search Ranking
  25. Altmetric Badge
    Chapter 24 Automata, Languages and Programming
  26. Altmetric Badge
    Chapter 25 The Compositional Structure of Multipartite Quantum Entanglement
  27. Altmetric Badge
    Chapter 26 Compositionality in Graph Transformation
  28. Altmetric Badge
    Chapter 27 On p-Optimal Proof Systems and Logics for PTIME
  29. Altmetric Badge
    Chapter 28 Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
  30. Altmetric Badge
    Chapter 29 Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals
  31. Altmetric Badge
    Chapter 30 B and D Are Enough to Make the Halpern–Shoham Logic Undecidable
  32. Altmetric Badge
    Chapter 31 Parameterized Modal Satisfiability
  33. Altmetric Badge
    Chapter 32 Automata for Coalgebras: An Approach Using Predicate Liftings
  34. Altmetric Badge
    Chapter 33 Resolving the Complexity of Some Data Privacy Problems
  35. Altmetric Badge
    Chapter 34 Private and Continual Release of Statistics
  36. Altmetric Badge
    Chapter 35 Envy-Free Pricing in Multi-item Markets
  37. Altmetric Badge
    Chapter 36 Automata, Languages and Programming
  38. Altmetric Badge
    Chapter 37 Automata, Languages and Programming
  39. Altmetric Badge
    Chapter 38 On Bisimilarity and Substitution in Presence of Replication
  40. Altmetric Badge
    Chapter 39 The Downward-Closure of Petri Net Languages
  41. Altmetric Badge
    Chapter 40 Reachability Games on Extended Vector Addition Systems with States
  42. Altmetric Badge
    Chapter 41 Modelling Mobility: A Discrete Revolution
  43. Altmetric Badge
    Chapter 42 Tell Me Where I Am So I Can Meet You Sooner
  44. Altmetric Badge
    Chapter 43 Rendezvous of Mobile Agents without Agreement on Local Orientation
  45. Altmetric Badge
    Chapter 44 Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
  46. Altmetric Badge
    Chapter 45 Space-Efficient Scheduling of Stochastically Generated Tasks
  47. Altmetric Badge
    Chapter 46 Exponential Lower Bounds for Policy Iteration
  48. Altmetric Badge
    Chapter 47 Regular Temporal Cost Functions
  49. Altmetric Badge
    Chapter 48 Model Checking Succinct and Parametric One-Counter Automata
  50. Altmetric Badge
    Chapter 49 Pebble Weighted Automata and Transitive Closure Logics
  51. Altmetric Badge
    Chapter 50 Energy Parity Games
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • Good Attention Score compared to outputs of the same age (78th percentile)
  • Good Attention Score compared to outputs of the same age and source (76th percentile)

Mentioned by

twitter
1 X user
wikipedia
5 Wikipedia pages
q&a
1 Q&A thread

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
9 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
ADS, January 2010
DOI 10.1007/978-3-642-14162-1
ISBNs
978-3-64-214161-4, 978-3-64-214162-1
Editors

Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user 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 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 9 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 44%
Student > Master 1 11%
Professor 1 11%
Researcher 1 11%
Librarian 1 11%
Other 0 0%
Unknown 1 11%
Readers by discipline Count As %
Computer Science 6 67%
Environmental Science 1 11%
Social Sciences 1 11%
Unknown 1 11%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 6. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 12 February 2023.
All research outputs
#4,841,315
of 23,341,064 outputs
Outputs from ADS
#4,654
of 37,942 outputs
Outputs of similar age
#27,634
of 166,155 outputs
Outputs of similar age from ADS
#136
of 808 outputs
Altmetric has tracked 23,341,064 research outputs across all sources so far. Compared to these this one has done well and is in the 76th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 37,942 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done well, scoring higher than 81% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 166,155 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 78% of its contemporaries.
We're also able to compare this research output to 808 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 76% of its contemporaries.