↓ Skip to main content

Fundamentals of Computation Theory

Overview of attention for book
Cover of 'Fundamentals of Computation Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Randomized complexity of linear arrangements and polyhedra?
  3. Altmetric Badge
    Chapter 2 Tile transition systems as structured coalgebras?
  4. Altmetric Badge
    Chapter 3 Caesar and DNA — views on cryptology
  5. Altmetric Badge
    Chapter 4 Automata and their interaction: Definitional suggestions
  6. Altmetric Badge
    Chapter 5 Axiomatising asynchronous process calculi
  7. Altmetric Badge
    Chapter 6 A polynomial time approximation scheme for dense MupIN 2 S{upAT}
  8. Altmetric Badge
    Chapter 7 Decidable classes of the verification problem in a timed predicate logic
  9. Altmetric Badge
    Chapter 8 Interpretations of extensible objects and types
  10. Altmetric Badge
    Chapter 9 Restrictive acceptance suffices for equivalence problems
  11. Altmetric Badge
    Chapter 10 Grammar systems as language analyzers and recursively enumerable languages
  12. Altmetric Badge
    Chapter 11 An interpretation of extensible objects
  13. Altmetric Badge
    Chapter 12 Modeling operating systems schedulers with multi-stack-queue grammars
  14. Altmetric Badge
    Chapter 13 Iterative arrays with a wee bit alternation
  15. Altmetric Badge
    Chapter 14 Secret sharing schemes with detection of cheaters for a general access structure
  16. Altmetric Badge
    Chapter 15 Constructive notes on uniform and locally convex spaces
  17. Altmetric Badge
    Chapter 16 Graph automorphisms with maximal projection distances
  18. Altmetric Badge
    Chapter 17 Kleene theorems for event-clock automata
  19. Altmetric Badge
    Chapter 18 Strong iteration lemmata for regular, linear, context-free, and linear indexed languages
  20. Altmetric Badge
    Chapter 19 Exponential output size of top-down tree transducers
  21. Altmetric Badge
    Chapter 20 On recognizable languages in divisibility monoids
  22. Altmetric Badge
    Chapter 21 Expressiveness of point-to-point versus broadcast communications
  23. Altmetric Badge
    Chapter 22 On relative loss bounds in generalized linear regression
  24. Altmetric Badge
    Chapter 23 Generalized P-systems
  25. Altmetric Badge
    Chapter 24 Optimal, distributed decision-making: The case of no communication
  26. Altmetric Badge
    Chapter 25 Generalized PCP is decidable for marked morphisms
  27. Altmetric Badge
    Chapter 26 On time-constructible functions in one-dimensional cellular automata
  28. Altmetric Badge
    Chapter 27 Dichotomy theorem for the generalized unique satisfiability problem
  29. Altmetric Badge
    Chapter 28 A general categorical connection between local event structures and local traces
  30. Altmetric Badge
    Chapter 29 Correct translation of mutually recursive function systems into TOL collage grammars
  31. Altmetric Badge
    Chapter 30 Synchronized product of linear bounded machines
  32. Altmetric Badge
    Chapter 31 On maximal repetitions in words
  33. Altmetric Badge
    Chapter 32 Axiomatization of the coherence property for categories of symmetries
  34. Altmetric Badge
    Chapter 33 Sewing grammars
  35. Altmetric Badge
    Chapter 34 State and transition complexity of Watson-Crick finite automata
  36. Altmetric Badge
    Chapter 35 A confluence result for a typed λ-calculus of exception handling with fixed-point
  37. Altmetric Badge
    Chapter 36 δ -Uniformly decidable sets and turing machines
  38. Altmetric Badge
    Chapter 37 A parallel context-free derivation hierarchy
  39. Altmetric Badge
    Chapter 38 Generalized synchronization languages
  40. Altmetric Badge
    Chapter 39 A generalization of Dijkstra’s calculus to typed program specifications
  41. Altmetric Badge
    Chapter 40 Homomorphisms and concurrent term rewriting
  42. Altmetric Badge
    Chapter 41 On two-sided infinite fixed points of morphisms
  43. Altmetric Badge
    Chapter 42 Tiling multi-dimensional arrays
  44. Altmetric Badge
    Chapter 43 Modeling interaction by sheaves and geometric logic
  45. Altmetric Badge
    Chapter 44 The operators minCh and maxCh on the polynomial hierarchy
  46. Altmetric Badge
    Chapter 45 The Kolmogorov complexity of real numbers
  47. Altmetric Badge
    Chapter 46 A partial order method for the verification of time Petri nets
  48. Altmetric Badge
    Chapter 47 Deriving formulas for domination numbers of fasciagraphs and rotagraphs
Attention for Chapter 18: Strong iteration lemmata for regular, linear, context-free, and linear indexed languages
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (83rd percentile)
  • Good Attention Score compared to outputs of the same age and source (65th percentile)

Mentioned by

wikipedia
1 Wikipedia page
q&a
1 Q&A thread

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
2 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
Strong iteration lemmata for regular, linear, context-free, and linear indexed languages
Chapter number 18
Book title
Fundamentals of Computation Theory
Published in
Lecture notes in computer science, January 1999
DOI 10.1007/3-540-48321-7_18
Book ISBNs
978-3-54-066412-3, 978-3-54-048321-2
Authors

Pál Dömösi, Manfred Kudlek, Pál Dömösi, Dömösi, Pál, Kudlek, Manfred

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 50%
Student > Doctoral Student 1 50%
Readers by discipline Count As %
Computer Science 1 50%
Engineering 1 50%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 6. 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 11 January 2019.
All research outputs
#5,516,934
of 22,714,025 outputs
Outputs from Lecture notes in computer science
#1,734
of 8,124 outputs
Outputs of similar age
#15,850
of 98,895 outputs
Outputs of similar age from Lecture notes in computer science
#5
of 20 outputs
Altmetric has tracked 22,714,025 research outputs across all sources so far. Compared to these this one has done well and is in the 75th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one has done well, scoring higher than 78% 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 98,895 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 83% of its contemporaries.
We're also able to compare this research output to 20 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 65% of its contemporaries.