↓ 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 Sharing in nondeterminism
  3. Altmetric Badge
    Chapter 2 Sur les mots sans carré définis par un morphisme
  4. Altmetric Badge
    Chapter 3 A characterization of abstract data as model-theoretic invariants
  5. Altmetric Badge
    Chapter 4 Inherent ambiguities in families of grammars extended abstract
  6. Altmetric Badge
    Chapter 5 Representing complexity classes by equality sets
  7. Altmetric Badge
    Chapter 6 Supercounter machines
  8. Altmetric Badge
    Chapter 7 Existential quantifiers in abstract data types
  9. Altmetric Badge
    Chapter 8 A generalization of Ginsburg and Rose's characterization of G-S-M mappings
  10. Altmetric Badge
    Chapter 9 Strict deterministic languages and controlled rewriting systems
  11. Altmetric Badge
    Chapter 10 Automata, Languages and Programming
  12. Altmetric Badge
    Chapter 11 Functional characterization of some semantic equalities inside λ-calculus
  13. Altmetric Badge
    Chapter 12 Arbitration and queueing under limited shared storage requirements
  14. Altmetric Badge
    Chapter 13 On the homomorphic characterizations of families of languages
  15. Altmetric Badge
    Chapter 14 Two level grammars: CF-grammars with equation schemes
  16. Altmetric Badge
    Chapter 15 Proving termination with multiset orderings
  17. Altmetric Badge
    Chapter 16 One abstract accepting algorithm for all kinds of parsers
  18. Altmetric Badge
    Chapter 17 Studies in abstract/concrete mappings in proving algorithm correctness
  19. Altmetric Badge
    Chapter 18 A characterization of a dot-depth two analogue of generalized definite languages
  20. Altmetric Badge
    Chapter 19 Partitioned LL(k) grammars
  21. Altmetric Badge
    Chapter 20 Recursion schemes and generalized interpretations
  22. Altmetric Badge
    Chapter 21 A rational theory of AFLs
  23. Altmetric Badge
    Chapter 22 On the succinctness of different representations of languages
  24. Altmetric Badge
    Chapter 23 A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs
  25. Altmetric Badge
    Chapter 24 Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons
  26. Altmetric Badge
    Chapter 25 A unique termination theorem for a theory with generalised commutative axioms
  27. Altmetric Badge
    Chapter 26 Dags and Chomsky hierarchy
  28. Altmetric Badge
    Chapter 27 Recent advances in the probabilistic analysis of graph-theoretic algorithms
  29. Altmetric Badge
    Chapter 28 On the average stack size of regularly distributed binary trees
  30. Altmetric Badge
    Chapter 29 On reductions of parallel programs
  31. Altmetric Badge
    Chapter 30 On the height of derivation trees
  32. Altmetric Badge
    Chapter 31 The modal logic of programs
  33. Altmetric Badge
    Chapter 32 A comparison between two variations of a pebble game on graphs
  34. Altmetric Badge
    Chapter 33 LL(k) parsing for attributed grammars
  35. Altmetric Badge
    Chapter 34 On eliminating nondeterminism from Turing machines which use less than logarithm worktape space
  36. Altmetric Badge
    Chapter 35 Structure preserving transformations on non-left-recursive grammars
  37. Altmetric Badge
    Chapter 36 The complexity of restricted minimum spanning tree problems
  38. Altmetric Badge
    Chapter 37 A systematic approach to formal language theory through parallel rewriting
  39. Altmetric Badge
    Chapter 38 Extending the notion of finite index
  40. Altmetric Badge
    Chapter 39 On the complexity of general context-free language parsing and recognition
  41. Altmetric Badge
    Chapter 40 Space-time tradeoffs for oblivious integer multiplication
  42. Altmetric Badge
    Chapter 41 Investigating programs in terms of partial graphs
  43. Altmetric Badge
    Chapter 42 On the power of random access machines
  44. Altmetric Badge
    Chapter 43 An axiomatic treatment of ALGOL 68 routines
  45. Altmetric Badge
    Chapter 44 P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
  46. Altmetric Badge
    Chapter 45 Constructing call-by-value continuation semantics
  47. Altmetric Badge
    Chapter 46 A formal semantics for concurrent systems
  48. Altmetric Badge
    Chapter 47 On constructing LL(k) parsers
  49. Altmetric Badge
    Chapter 48 More on advice on structuring compilers and proving them correct
  50. Altmetric Badge
    Chapter 49 Languages of nilpotent and solvable groups (extended abstract)
  51. Altmetric Badge
    Chapter 50 Unique fixed points vs. least fixed points
  52. Altmetric Badge
    Chapter 51 A modification of the LR(k) method for constructing compact bottom-up parsers
  53. Altmetric Badge
    Chapter 52 Optimal decomposition of linear automata
  54. Altmetric Badge
    Chapter 53 Bracketed two-level grammars — A decidable and practical approach to language definitions
Attention for Chapter 10: Automata, Languages and Programming
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
34 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
Automata, Languages and Programming
Chapter number 10
Book title
Automata, Languages and Programming
Published in
Lecture notes in computer science, July 1979
DOI 10.1007/3-540-09510-1_10
Book ISBNs
978-3-54-009510-1, 978-3-54-035168-9
Authors

Beate Commentz-Walter, Commentz-Walter, Beate

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Portugal 1 3%
Sweden 1 3%
Unknown 32 94%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 6 18%
Student > Bachelor 5 15%
Researcher 4 12%
Professor 3 9%
Student > Doctoral Student 2 6%
Other 8 24%
Unknown 6 18%
Readers by discipline Count As %
Computer Science 19 56%
Engineering 4 12%
Linguistics 1 3%
Unspecified 1 3%
Social Sciences 1 3%
Other 1 3%
Unknown 7 21%
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 19 March 2022.
All research outputs
#7,682,308
of 23,376,718 outputs
Outputs from Lecture notes in computer science
#2,495
of 8,159 outputs
Outputs of similar age
#1,447
of 5,948 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 1 outputs
Altmetric has tracked 23,376,718 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,159 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.1. This one has gotten more attention than average, scoring higher than 54% 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 5,948 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 8th percentile – i.e., 8% 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