↓ Skip to main content

Computer Science – Theory and Applications

Overview of attention for book
Cover of 'Computer Science – Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Equivalence of Sampling and Searching
  3. Altmetric Badge
    Chapter 2 Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
  4. Altmetric Badge
    Chapter 3 Learning Read-Constant Polynomials of Constant Degree Modulo Composites
  5. Altmetric Badge
    Chapter 4 On the Arithmetic Complexity of Euler Function
  6. Altmetric Badge
    Chapter 5 Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error
  7. Altmetric Badge
    Chapter 6 Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization
  8. Altmetric Badge
    Chapter 7 The Complexity of Solving Reachability Games Using Value and Strategy Iteration
  9. Altmetric Badge
    Chapter 8 Faster Polynomial Multiplication via Discrete Fourier Transforms
  10. Altmetric Badge
    Chapter 9 Kolmogorov Complexity as a Language
  11. Altmetric Badge
    Chapter 10 Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs
  12. Altmetric Badge
    Chapter 11 The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms
  13. Altmetric Badge
    Chapter 12 Gate Elimination for Linear Functions and New Feebly Secure Constructions
  14. Altmetric Badge
    Chapter 13 Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas
  15. Altmetric Badge
    Chapter 14 On Maltsev Digraphs
  16. Altmetric Badge
    Chapter 15 Join-Reachability Problems in Directed Graphs
  17. Altmetric Badge
    Chapter 16 Graphs of Bounded Treewidth Can Be Canonized in  $\mbox{{\sf AC}$^1$}$
  18. Altmetric Badge
    Chapter 17 Snakes and Cellular Automata: Reductions and Inseparability Results
  19. Altmetric Badge
    Chapter 18 Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width
  20. Altmetric Badge
    Chapter 19 An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents
  21. Altmetric Badge
    Chapter 20 Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees
  22. Altmetric Badge
    Chapter 21 Compressed Membership in Automata with Compressed Labels
  23. Altmetric Badge
    Chapter 22 Locally Decodable Codes
  24. Altmetric Badge
    Chapter 23 Precedence Automata and Languages
  25. Altmetric Badge
    Chapter 24 Orbits of Linear Maps and Regular Languages
  26. Altmetric Badge
    Chapter 25 Shared-Memory Systems and Charts
  27. Altmetric Badge
    Chapter 26 On the CSP Dichotomy Conjecture
  28. Altmetric Badge
    Chapter 27 LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata
  29. Altmetric Badge
    Chapter 28 Two-Way Automata versus Logarithmic Space
  30. Altmetric Badge
    Chapter 29 A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row
  31. Altmetric Badge
    Chapter 30 Two Combinatorial Criteria for BWT Images
  32. Altmetric Badge
    Chapter 31 Recent Results on Polynomial Identity Testing
  33. Altmetric Badge
    Chapter 32 Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition
  34. Altmetric Badge
    Chapter 33 The Optimal Strategy for the Average Long-Lived Consensus
  35. Altmetric Badge
    Chapter 34 Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs
  36. Altmetric Badge
    Chapter 35 Recognizing Sparse Perfect Elimination Bipartite Graphs
  37. Altmetric Badge
    Chapter 36 A Multiple-Conclusion Calculus for First-Order Gödel Logic
Attention for Chapter 27: LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Average Attention Score compared to outputs of the same age and source

Mentioned by

wikipedia
2 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 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
LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata
Chapter number 27
Book title
Computer Science – Theory and Applications
Published in
Lecture notes in computer science, June 2011
DOI 10.1007/978-3-642-20712-9_27
Book ISBNs
978-3-64-220711-2, 978-3-64-220712-9
Authors

Tamar Aizikowitz, Michael Kaminski

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 100%
Readers by discipline Count As %
Computer Science 1 100%
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 26 March 2017.
All research outputs
#7,523,962
of 22,961,203 outputs
Outputs from Lecture notes in computer science
#2,489
of 8,137 outputs
Outputs of similar age
#41,594
of 114,271 outputs
Outputs of similar age from Lecture notes in computer science
#13
of 65 outputs
Altmetric has tracked 22,961,203 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,137 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 114,271 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 33rd percentile – i.e., 33% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 65 others from the same source and published within six weeks on either side of this one. This one is in the 49th percentile – i.e., 49% of its contemporaries scored the same or lower than it.