↓ 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 48 The generative power of two-level grammars
  3. Altmetric Badge
    Chapter 49 A generalisation of Parikh's theorem in formal language theory
  4. Altmetric Badge
    Chapter 50 Checking stacks and context-free programmed grammars accept p-complete languages
  5. Altmetric Badge
    Chapter 51 Recursion and parameter mechanisms: An axiomatic approach
  6. Altmetric Badge
    Chapter 52 Dynamic programming schemata
  7. Altmetric Badge
    Chapter 53 Semantic characterization of flow diagrams and their decomposability
  8. Altmetric Badge
    Chapter 54 On the most recent property of ALGOL-like programs
  9. Altmetric Badge
    Chapter 55 Langages sans etiquettes et transformations de programmes
  10. Altmetric Badge
    Chapter 56 Relations between semantics and complexity of recursive programs-
  11. Altmetric Badge
    Chapter 57 On the relation between direct and continuation semantics
  12. Altmetric Badge
    Chapter 58 Graph representation and computation rules for typeless recursive languages
  13. Altmetric Badge
    Chapter 59 Application of Church-Rosser properties to increase the parallelism and efficiency of algorithms
  14. Altmetric Badge
    Chapter 60 Combinatorial problems, combinator equations and normal forms
  15. Altmetric Badge
    Chapter 61 Algorithmes d'Equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples
  16. Altmetric Badge
    Chapter 62 Automatic generation of multiple exit parsing subroutines
  17. Altmetric Badge
    Chapter 63 Production prefix parsing
  18. Altmetric Badge
    Chapter 64 On eliminating unit productions from LR(k) parsers
  19. Altmetric Badge
    Chapter 65 Deterministic techniques for efficient non-deterministic parsers
  20. Altmetric Badge
    Chapter 66 File organization, an application of graph theory
  21. Altmetric Badge
    Chapter 67 Characterizations of time-bounded computations by limited primitive recursion
  22. Altmetric Badge
    Chapter 68 On maximal merging of information in Boolean computations
  23. Altmetric Badge
    Chapter 69 On simple Goedel numberings and translations
  24. Altmetric Badge
    Chapter 70 The ‘almost all’ theory of subrecursive degrees is decidable
  25. Altmetric Badge
    Chapter 71 The computational complexity of program schemata
  26. Altmetric Badge
    Chapter 72 Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d'automorphismes d'un automate fini
  27. Altmetric Badge
    Chapter 73 Sur l'Application du theoreme de suschkewitsch a l'etude des codes rationnels complets
  28. Altmetric Badge
    Chapter 74 Composition of automata
  29. Altmetric Badge
    Chapter 75 Context-free grammar forms
  30. Altmetric Badge
    Chapter 76 Une suite decroissante de cônes rationnels
  31. Altmetric Badge
    Chapter 77 Komplexitätsmaße for Ausdrocke
  32. Altmetric Badge
    Chapter 78 Efficient procedures for using matrix algorithms
  33. Altmetric Badge
    Chapter 79 Further schemes for combining matrix algorithms
  34. Altmetric Badge
    Chapter 80 On the structure of complexity classes
  35. Altmetric Badge
    Chapter 81 On sets having only hard subsets
  36. Altmetric Badge
    Chapter 82 Turing machines with associative memory access
  37. Altmetric Badge
    Chapter 83 Trade-off between the use of nonterminals, codings and homomorphisms in defining languages for some classes of rewriting systems
  38. Altmetric Badge
    Chapter 84 Operators reducing generalized OL-systems
  39. Altmetric Badge
    Chapter 85 Parallel rewriting systems on terms
  40. Altmetric Badge
    Chapter 86 Transductions of context-free languages into sets of sentential forms
  41. Altmetric Badge
    Chapter 87 Parallelism in rewriting systems
  42. Altmetric Badge
    Chapter 88 Mehrdeutigkeiten kontextfreier Grammatiken
  43. Altmetric Badge
    Chapter 89 Monadic program schemes under restricted classes of free interpretations
  44. Altmetric Badge
    Chapter 90 Generalized program schemas
  45. Altmetric Badge
    Chapter 91 A decidability result for sequential grammars
  46. Altmetric Badge
    Chapter 92 Effectivity problems of algorithmic logic
  47. Altmetric Badge
    Chapter 93 Simple and structural redundancy in non-deterministic computation
  48. Altmetric Badge
    Chapter 94 Sur une propriete syntactique des relations rationnelles
Attention for Chapter 38: Parallel Rewriting Systems on Terms
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions
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
Parallel Rewriting Systems on Terms
Chapter number 38
Book title
Automata, Languages and Programming
Published in
Lecture notes in computer science, July 1974
DOI 10.1007/978-3-662-21545-6_38
Book ISBNs
978-3-54-006841-9, 978-3-66-221545-6
Authors

Karel Culik, T. S. E. Maibaum, Culik, Karel, Maibaum, T. S. E.

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 03 April 2021.
All research outputs
#7,555,516
of 23,047,237 outputs
Outputs from Lecture notes in computer science
#2,490
of 8,143 outputs
Outputs of similar age
#855
of 3,944 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 4 outputs
Altmetric has tracked 23,047,237 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,143 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 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 3,944 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 4 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