↓ 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 Hunting Redundancies in Strings
  3. Altmetric Badge
    Chapter 2 Some Remarks on Automata Minimality
  4. Altmetric Badge
    Chapter 3 Growth Properties of Power-Free Languages
  5. Altmetric Badge
    Chapter 4 A Functional Program for Regular Expressions Matching
  6. Altmetric Badge
    Chapter 5 State Complexity Research and Approximation
  7. Altmetric Badge
    Chapter 6 Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees
  8. Altmetric Badge
    Chapter 7 Avoiding Abelian Powers in Partial Words
  9. Altmetric Badge
    Chapter 8 Regular Splicing Languages Must Have a Constant
  10. Altmetric Badge
    Chapter 9 The Average Transition Complexity of Glushkov and Partial Derivative Automata
  11. Altmetric Badge
    Chapter 10 Theory of Átomata
  12. Altmetric Badge
    Chapter 11 Syntactic Complexity of Ideal and Closed Languages
  13. Altmetric Badge
    Chapter 12 Generalized One-Unambiguity
  14. Altmetric Badge
    Chapter 13 Simulations over Two-Dimensional On-Line Tessellation Automata
  15. Altmetric Badge
    Chapter 14 Δ-Clearing Restarting Automata and \(\makebox{\sf CFL} \)
  16. Altmetric Badge
    Chapter 15 Enumeration and Decidable Properties of Automatic Sequences
  17. Altmetric Badge
    Chapter 16 Languages vs. ω-Languages in Regular Infinite Games
  18. Altmetric Badge
    Chapter 17 Solving Word Problems in Group Extensions over Infinite Words
  19. Altmetric Badge
    Chapter 18 Abelian Primitive Words
  20. Altmetric Badge
    Chapter 19 Scattered Context-Free Linear Orderings
  21. Altmetric Badge
    Chapter 20 On Prefix Normal Words
  22. Altmetric Badge
    Chapter 21 On Non-complete Sets and Restivo’s Conjecture
  23. Altmetric Badge
    Chapter 22 Self-organization in Cellular Automata: A Particle-Based Approach
  24. Altmetric Badge
    Chapter 23 Chop Operations and Expressions: Descriptional Complexity Considerations
  25. Altmetric Badge
    Chapter 24 Nodes Connected by Path Languages
  26. Altmetric Badge
    Chapter 25 Characterizing the Regular Languages by Nonforgetting Restarting Automata
  27. Altmetric Badge
    Chapter 26 On Two-Way Transducers
  28. Altmetric Badge
    Chapter 27 There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages
  29. Altmetric Badge
    Chapter 28 Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
  30. Altmetric Badge
    Chapter 29 Deciding Networks of Evolutionary Processors
  31. Altmetric Badge
    Chapter 30 From Linear Partitions to Parallelogram Polyominoes
  32. Altmetric Badge
    Chapter 31 On Brzozowski’s Conjecture for the Free Burnside Semigroup Satisfying x 2 = x 3
  33. Altmetric Badge
    Chapter 32 Never Minimal Automata and the Rainbow Bipartite Subgraph Problem
  34. Altmetric Badge
    Chapter 33 Boolean Algebras of Regular Languages
  35. Altmetric Badge
    Chapter 34 Fife’s Theorem Revisited
  36. Altmetric Badge
    Chapter 35 Infinite Words Rich and Almost Rich in Generalized Palindromes
  37. Altmetric Badge
    Chapter 36 Models of Pushdown Automata with Reset
  38. Altmetric Badge
    Chapter 37 Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices
  39. Altmetric Badge
    Chapter 38 On Highly Repetitive and Power Free Words
  40. Altmetric Badge
    Chapter 39 A Sufficient Condition for Erasing Productions to Be Avoidable
  41. Altmetric Badge
    Chapter 40 Encoding Centered Polyominoes by Means of a Regular Language
  42. Altmetric Badge
    Chapter 41 Computational Aspects of Asynchronous Cellular Automata
  43. Altmetric Badge
    Chapter 42 Short 3-Collapsing Words over a 2-Letter Alphabet
  44. Altmetric Badge
    Chapter 43 A Cascade Decomposition of Weighted Finite Transition Systems
  45. Altmetric Badge
    Chapter 44 Morphic Characterizations in Terms of Insertion Systems with a Context of Length One
  46. Altmetric Badge
    Chapter 45 Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
  47. Altmetric Badge
    Chapter 46 Developments in Language Theory
Attention for Chapter 28: Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age and source (65th percentile)

Mentioned by

wikipedia
2 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
4 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
Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
Chapter number 28
Book title
Developments in Language Theory
Published in
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-22321-1_28
Book ISBNs
978-3-64-222320-4, 978-3-64-222321-1
Authors

Michal Kunc, Alexander Okhotin, Kunc, Michal, Okhotin, Alexander

Editors

Giancarlo Mauri, Alberto Leporati

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Professor 3 75%
Researcher 1 25%
Readers by discipline Count As %
Computer Science 4 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 15 July 2017.
All research outputs
#7,485,442
of 22,879,161 outputs
Outputs from Lecture notes in computer science
#2,487
of 8,130 outputs
Outputs of similar age
#54,477
of 180,977 outputs
Outputs of similar age from Lecture notes in computer science
#75
of 317 outputs
Altmetric has tracked 22,879,161 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,130 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 180,977 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 317 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.