↓ Skip to main content

Developments in Language Theory

Overview of attention for book
Cover of 'Developments in Language Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Recognisable Languages over Monads
  3. Altmetric Badge
    Chapter 2 Garside and Quadratic Normalisation: A Survey
  4. Altmetric Badge
    Chapter 3 Grammar-Based Tree Compression
  5. Altmetric Badge
    Chapter 4 On Decidability of Intermediate Levels of Concatenation Hierarchies
  6. Altmetric Badge
    Chapter 5 Ergodic Infinite Permutations of Minimal Complexity
  7. Altmetric Badge
    Chapter 6 Diverse Palindromic Factorization Is NP-complete
  8. Altmetric Badge
    Chapter 7 Factorization in Formal Languages
  9. Altmetric Badge
    Chapter 8 Consensus Game Acceptors
  10. Altmetric Badge
    Chapter 9 On the Size of Two-Way Reasonable Automata for the Liveness Problem
  11. Altmetric Badge
    Chapter 10 Squareable Words
  12. Altmetric Badge
    Chapter 11 Complexity Analysis: Transformation Monoids of Finite Automata
  13. Altmetric Badge
    Chapter 12 Palindromic Complexity of Trees
  14. Altmetric Badge
    Chapter 13 Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts
  15. Altmetric Badge
    Chapter 14 Transfinite Lyndon Words
  16. Altmetric Badge
    Chapter 15 Unary Patterns with Permutations
  17. Altmetric Badge
    Chapter 16 Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
  18. Altmetric Badge
    Chapter 17 Enumeration Formulæ in Neutral Sets
  19. Altmetric Badge
    Chapter 18 On the Density of Context-Free and Counter Languages
  20. Altmetric Badge
    Chapter 19 *-Continuous Kleene $$\omega $$ ω -Algebras
  21. Altmetric Badge
    Chapter 20 Unary Probabilistic and Quantum Automata on Promise Problems
  22. Altmetric Badge
    Chapter 21 Generalizations of Code Languages with Marginal Errors
  23. Altmetric Badge
    Chapter 22 Minimal Reversible Deterministic Finite Automata
  24. Altmetric Badge
    Chapter 23 Multi-sequential Word Relations
  25. Altmetric Badge
    Chapter 24 The Boundary of Prefix-Free Languages
  26. Altmetric Badge
    Chapter 25 A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
  27. Altmetric Badge
    Chapter 26 Path Checking for MTL and TPTL over Data Words
  28. Altmetric Badge
    Chapter 27 On Distinguishing NC $$^1$$ 1 and NL
  29. Altmetric Badge
    Chapter 28 Surminimisation of Automata
  30. Altmetric Badge
    Chapter 29 On the Complexity of k-Piecewise Testability and the Depth of Automata
  31. Altmetric Badge
    Chapter 30 Interval Exchange Words and the Question of Hof, Knill, and Simon
  32. Altmetric Badge
    Chapter 31 State Complexity of Neighbourhoods and Approximate Pattern Matching
  33. Altmetric Badge
    Chapter 32 Deterministic Ordered Restarting Automata that Compute Functions
  34. Altmetric Badge
    Chapter 33 Weight Assignment Logic
  35. Altmetric Badge
    Chapter 34 Complexity Bounds of Constant-Space Quantum Computation
Overall attention for this book and its chapters
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

twitter
2 X users

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.
Title
Developments in Language Theory
Published by
Lecture notes in computer science, January 2015
DOI 10.1007/978-3-319-21500-6
ISBNs
978-3-31-921499-3, 978-3-31-921500-6
Authors

Bell, Paul C., Reidenbach, Daniel, Shallit, J.O.

Editors

Igor Potapov

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users 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 > Associate 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 2. 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 02 October 2017.
All research outputs
#14,341,817
of 22,965,074 outputs
Outputs from Lecture notes in computer science
#4,325
of 8,137 outputs
Outputs of similar age
#188,054
of 354,064 outputs
Outputs of similar age from Lecture notes in computer science
#149
of 257 outputs
Altmetric has tracked 22,965,074 research outputs across all sources so far. This one is in the 35th percentile – i.e., 35% 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 is in the 44th percentile – i.e., 44% 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 354,064 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 44th percentile – i.e., 44% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 257 others from the same source and published within six weeks on either side of this one. This one is in the 38th percentile – i.e., 38% of its contemporaries scored the same or lower than it.