↓ 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 Refined analysis and improvements on some factoring algorithms
  3. Altmetric Badge
    Chapter 2 Absolute primality of polynomials is decidable in random polynomial time in the number of variables
  4. Altmetric Badge
    Chapter 3 Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform
  5. Altmetric Badge
    Chapter 4 Cost tradeoffs in graph embeddings, with applications
  6. Altmetric Badge
    Chapter 5 Minimum s-t cut of a planar undirected network in o(n log2(n)) time
  7. Altmetric Badge
    Chapter 6 On the density of color-families
  8. Altmetric Badge
    Chapter 7 The implication problem for data dependencies
  9. Altmetric Badge
    Chapter 8 Characterizing data base Dependencies
  10. Altmetric Badge
    Chapter 9 Data flow analysis of applicative programs
  11. Altmetric Badge
    Chapter 10 Flow analysis of lambda expressions
  12. Altmetric Badge
    Chapter 11 Algorithmic specifications of abstract data types
  13. Altmetric Badge
    Chapter 12 Nondeterminism in abstract data types
  14. Altmetric Badge
    Chapter 13 A view of directions in relational database theory
  15. Altmetric Badge
    Chapter 14 A new characterization of the regular languages
  16. Altmetric Badge
    Chapter 15 Langages Reconnaissables et Codage Prefixe Pur
  17. Altmetric Badge
    Chapter 16 Passes, sweeps and visits
  18. Altmetric Badge
    Chapter 17 On LALR(k) testing
  19. Altmetric Badge
    Chapter 18 On size bounds for deterministic parsers
  20. Altmetric Badge
    Chapter 19 A decision procedure for the equivalence of two dpdas one of which is linear
  21. Altmetric Badge
    Chapter 20 The deducibility problem in Propositional Dynamic Logic
  22. Altmetric Badge
    Chapter 21 Finite models for deterministic propositional dynamic logic
  23. Altmetric Badge
    Chapter 22 Impartiality, justice and fairness: The ethics of concurrent termination
  24. Altmetric Badge
    Chapter 23 Computing a perfect strategy for n×n chess requires time exponential in n
  25. Altmetric Badge
    Chapter 24 On the complexity of simple arithmetic expressions
  26. Altmetric Badge
    Chapter 25 Proving lower bounds for linear decision trees
  27. Altmetric Badge
    Chapter 26 Parikh-bounded languages
  28. Altmetric Badge
    Chapter 27 Generalized Parikh mappings and homomorphisms
  29. Altmetric Badge
    Chapter 28 Chomsky-Schotzenberger representations for families of languages and grammatical types
  30. Altmetric Badge
    Chapter 29 Algebraically specified programming systems and Hoare's logic
  31. Altmetric Badge
    Chapter 30 Automatic construction of verification condition generators from hoare logics
  32. Altmetric Badge
    Chapter 31 Circular expressions: Elimination of static environments
  33. Altmetric Badge
    Chapter 32 An axiomatic approach to the Korenjak - Hopcroft algorithms
  34. Altmetric Badge
    Chapter 33 On the (generalized) post correspondence problem with lists of length 2
  35. Altmetric Badge
    Chapter 34 A sparse table implementation of priority queues
  36. Altmetric Badge
    Chapter 35 Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems
  37. Altmetric Badge
    Chapter 36 Termination of linear rewriting systems
  38. Altmetric Badge
    Chapter 37 Realizing an equational specification
  39. Altmetric Badge
    Chapter 38 A cook's tour of countable nondeterminism
  40. Altmetric Badge
    Chapter 39 The complexity of decision problems for finite-turn multicounter machines
  41. Altmetric Badge
    Chapter 40 Alternating multihead finite automata
  42. Altmetric Badge
    Chapter 41 The solution for the branching factor of the alpha-beta pruning algorithm
  43. Altmetric Badge
    Chapter 42 Uniform complexity and digital signatures
  44. Altmetric Badge
    Chapter 43 On the generation of cryptographically strong pseudo-random sequences
  45. Altmetric Badge
    Chapter 44 Measuring the expressive power of dynamic logics: An application of abstract model theory
Attention for Chapter 22: Impartiality, justice and fairness: The ethics of concurrent termination
Altmetric Badge

Mentioned by

q&a
1 Q&A thread

Readers on

mendeley
21 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.
Chapter title
Impartiality, justice and fairness: The ethics of concurrent termination
Chapter number 22
Book title
Automata, Languages and Programming
Published in
Lecture notes in computer science, July 1981
DOI 10.1007/3-540-10843-2_22
Book ISBNs
978-3-54-010843-6, 978-3-54-038745-9
Authors

D. Lehmann, A. Pnueli, J. Stavi, Lehmann, D., Pnueli, A., Stavi, J.

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 5%
United States 1 5%
France 1 5%
Austria 1 5%
Unknown 17 81%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 7 33%
Student > Master 4 19%
Professor 3 14%
Professor > Associate Professor 3 14%
Researcher 1 5%
Other 1 5%
Unknown 2 10%
Readers by discipline Count As %
Computer Science 16 76%
Social Sciences 1 5%
Engineering 1 5%
Unknown 3 14%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 22 October 2014.
All research outputs
#12,930,522
of 22,817,213 outputs
Outputs from Lecture notes in computer science
#3,776
of 8,124 outputs
Outputs of similar age
#6,547
of 7,140 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 1 outputs
Altmetric has tracked 22,817,213 research outputs across all sources so far. This one is in the 42nd percentile – i.e., 42% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 51% 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 7,140 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 7th percentile – i.e., 7% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 1 others from the same source and published within six weeks on either side of this one. This one has scored higher than all of them