↓ Skip to main content

Language and Automata Theory and Applications

Overview of attention for book
Cover of 'Language and Automata Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Complexity Dichotomy for Counting Problems
  3. Altmetric Badge
    Chapter 2 Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems
  4. Altmetric Badge
    Chapter 3 Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
  5. Altmetric Badge
    Chapter 4 Discrete Linear Dynamical Systems
  6. Altmetric Badge
    Chapter 5 XML Schema Management: A Challenge for Automata Theory
  7. Altmetric Badge
    Chapter 6 On the Complexity of Shortest Path Problems on Discounted Cost Graphs
  8. Altmetric Badge
    Chapter 7 Termination of Rule-Based Calculi for Uniform Semi-Unification
  9. Altmetric Badge
    Chapter 8 Deciding WQO for Factorial Languages
  10. Altmetric Badge
    Chapter 9 On the Construction of a Family of Automata That Are Generically Non-minimal
  11. Altmetric Badge
    Chapter 10 Limited Non-determinism Hierarchy of Counter Automata
  12. Altmetric Badge
    Chapter 11 Unambiguous Automata Denoting Finitely Sequential Functions
  13. Altmetric Badge
    Chapter 12 Duplication-Loss Genome Alignment: Complexity and Algorithm
  14. Altmetric Badge
    Chapter 13 Maximizing Entropy over Markov Processes
  15. Altmetric Badge
    Chapter 14 MAT Learning of Universal Automata
  16. Altmetric Badge
    Chapter 15 A Graph Polynomial Approach to Primitivity
  17. Altmetric Badge
    Chapter 16 Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
  18. Altmetric Badge
    Chapter 17 Dynamic Communicating Automata and Branching High-Level MSCs
  19. Altmetric Badge
    Chapter 18 Visibly Pushdown Automata: Universality and Inclusion via Antichains
  20. Altmetric Badge
    Chapter 19 Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions
  21. Altmetric Badge
    Chapter 20 Language and Automata Theory and Applications
  22. Altmetric Badge
    Chapter 21 Execution Information Rate for Some Classes of Automata
  23. Altmetric Badge
    Chapter 22 Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks
  24. Altmetric Badge
    Chapter 23 The Buffered π -Calculus: A Model for Concurrent Languages
  25. Altmetric Badge
    Chapter 24 Mix-Automatic Sequences
  26. Altmetric Badge
    Chapter 25 A Multivariate Analysis of Some DFA Problems
  27. Altmetric Badge
    Chapter 26 On the Size Complexity of Deterministic Frequency Automata
  28. Altmetric Badge
    Chapter 27 On the Number of Unbordered Factors
  29. Altmetric Badge
    Chapter 28 Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences
  30. Altmetric Badge
    Chapter 29 Efficient Submatch Extraction for Practical Regular Expressions
  31. Altmetric Badge
    Chapter 30 Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers
  32. Altmetric Badge
    Chapter 31 Revealing vs. Concealing: More Simulation Games for Büchi Inclusion
  33. Altmetric Badge
    Chapter 32 On Bounded Languages and Reversal-Bounded Automata
  34. Altmetric Badge
    Chapter 33 Rewrite Closure and CF Hedge Automata
  35. Altmetric Badge
    Chapter 34 Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing
  36. Altmetric Badge
    Chapter 35 From Regular Tree Expression to Position Tree Automaton
  37. Altmetric Badge
    Chapter 36 Convergence of Newton’s Method over Commutative Semirings
  38. Altmetric Badge
    Chapter 37 Counting Minimal Symmetric Difference NFAs
  39. Altmetric Badge
    Chapter 38 Interval Logics and ωB -Regular Languages
  40. Altmetric Badge
    Chapter 39 Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars
  41. Altmetric Badge
    Chapter 40 Asynchronous PC Systems of Pushdown Automata
  42. Altmetric Badge
    Chapter 41 Model Checking Metric Temporal Logic over Automata with One Counter
  43. Altmetric Badge
    Chapter 42 Coinductive Proof Techniques for Language Equivalence
  44. Altmetric Badge
    Chapter 43 Ostrowski Numeration and the Local Period of Sturmian Words
  45. Altmetric Badge
    Chapter 44 Boolean Algebras of Regular ω -Languages
  46. Altmetric Badge
    Chapter 45 Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars
  47. Altmetric Badge
    Chapter 46 Online Matching of Multiple Regular Patterns with Gaps and Character Classes
  48. Altmetric Badge
    Chapter 47 Infiniteness and Boundedness in 0L, DT0L, and T0L Systems
  49. Altmetric Badge
    Chapter 48 Uniformisation of Two-Way Transducers
  50. Altmetric Badge
    Chapter 49 A Conditional Superpolynomial Lower Bound for Extended Resolution
  51. Altmetric Badge
    Chapter 50 A Turing Machine Distance Hierarchy
Attention for Chapter 45: Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars
Altmetric Badge

About this Attention Score

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

Mentioned by

twitter
1 X user

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
Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars
Chapter number 45
Book title
Language and Automata Theory and Applications
Published in
Lecture notes in computer science, April 2013
DOI 10.1007/978-3-642-37064-9_45
Book ISBNs
978-3-64-237063-2, 978-3-64-237064-9
Authors

Eli Shamir

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 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 %
Professor 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 1. 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 17 March 2013.
All research outputs
#15,266,089
of 22,701,287 outputs
Outputs from Lecture notes in computer science
#4,646
of 8,125 outputs
Outputs of similar age
#124,927
of 199,766 outputs
Outputs of similar age from Lecture notes in computer science
#19
of 41 outputs
Altmetric has tracked 22,701,287 research outputs across all sources so far. This one is in the 22nd percentile – i.e., 22% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,125 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 27th percentile – i.e., 27% of its peers scored the same or lower than it.
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 199,766 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 27th percentile – i.e., 27% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 41 others from the same source and published within six weeks on either side of this one. This one is in the 36th percentile – i.e., 36% of its contemporaries scored the same or lower than it.