↓ Skip to main content

Descriptional Complexity of Formal Systems

Overview of attention for book
Cover of 'Descriptional Complexity of Formal Systems'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Recent Developments in Quantum Algorithms and Complexity
  3. Altmetric Badge
    Chapter 2 Automata with Reversal-Bounded Counters: A Survey
  4. Altmetric Badge
    Chapter 3 Star-Free Languages and Local Divisors
  5. Altmetric Badge
    Chapter 4 Aperiodic Tilings by Right Triangles
  6. Altmetric Badge
    Chapter 5 Quantum Hashing via ε -Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas
  7. Altmetric Badge
    Chapter 6 Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
  8. Altmetric Badge
    Chapter 7 Matter and Anti-Matter in Membrane Systems
  9. Altmetric Badge
    Chapter 8 Complexity of Extended vs. Classic LR Parsers
  10. Altmetric Badge
    Chapter 9 Most Complex Regular Right-Ideal Languages
  11. Altmetric Badge
    Chapter 10 State Complexity of Inversion Operations
  12. Altmetric Badge
    Chapter 11 Cycles and Global Attractors of Reaction Systems
  13. Altmetric Badge
    Chapter 12 Classical Automata on Promise Problems
  14. Altmetric Badge
    Chapter 13 From Ultrafilters on Words to the Expressive Power of a Fragment of Logic
  15. Altmetric Badge
    Chapter 14 Computation Width and Deviation Number
  16. Altmetric Badge
    Chapter 15 Boundary Sets of Regular and Context-Free Languages
  17. Altmetric Badge
    Chapter 16 Biclique Coverings, Rectifier Networks and the Cost of ε -Removal
  18. Altmetric Badge
    Chapter 17 Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
  19. Altmetric Badge
    Chapter 18 A Full and Linear Index of a Tree for Tree Patterns
  20. Altmetric Badge
    Chapter 19 Prefix-Free Languages: Right Quotient and Reversal
  21. Altmetric Badge
    Chapter 20 Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
  22. Altmetric Badge
    Chapter 21 On the State Complexity of Closures and Interiors of Regular Languages with Subwords
  23. Altmetric Badge
    Chapter 22 State Complexity of Regular Tree Languages for Tree Pattern Matching
  24. Altmetric Badge
    Chapter 23 On the Complexity of L -reachability
  25. Altmetric Badge
    Chapter 24 Positive and Negative Proofs for Circuits and Branching Programs
  26. Altmetric Badge
    Chapter 25 Regularity and Size of Set Automata
  27. Altmetric Badge
    Chapter 26 Operational State Complexity under Parikh Equivalence
  28. Altmetric Badge
    Chapter 27 Complexity of Checking Whether Two Automata Are Synchronized by the Same Language
  29. Altmetric Badge
    Chapter 28 On the Descriptional Complexity of Deterministic Ordered Restarting Automata
  30. Altmetric Badge
    Chapter 29 State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism
  31. Altmetric Badge
    Chapter 30 A Note on Pushdown Automata Systems
  32. Altmetric Badge
    Chapter 31 Non-recursive Trade-offs between Two-Dimensional Automata and Grammars
Attention for Chapter 3: Star-Free Languages and Local Divisors
Altmetric Badge

Mentioned by

twitter
1 X user

Readers on

mendeley
3 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
Star-Free Languages and Local Divisors
Chapter number 3
Book title
Descriptional Complexity of Formal Systems
Published in
Lecture notes in computer science, January 2014
DOI 10.1007/978-3-319-09704-6_3
Book ISBNs
978-3-31-909703-9, 978-3-31-909704-6
Authors

Kufleitner, Manfred, Manfred Kufleitner

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 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 1 33%
Student > Doctoral Student 1 33%
Student > Master 1 33%
Readers by discipline Count As %
Mathematics 1 33%
Computer Science 1 33%
Engineering 1 33%
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 14 August 2014.
All research outputs
#20,234,388
of 22,760,687 outputs
Outputs from Lecture notes in computer science
#6,981
of 8,125 outputs
Outputs of similar age
#264,827
of 305,286 outputs
Outputs of similar age from Lecture notes in computer science
#235
of 279 outputs
Altmetric has tracked 22,760,687 research outputs across all sources so far. This one is in the 1st percentile – i.e., 1% 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 1st percentile – i.e., 1% 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 305,286 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 279 others from the same source and published within six weeks on either side of this one. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.