↓ 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 Recent Developments in Algorithmic Teaching
  3. Altmetric Badge
    Chapter 2 Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
  4. Altmetric Badge
    Chapter 3 Descriptional and Computational Complexity of Finite Automata
  5. Altmetric Badge
    Chapter 4 Hypothesis Spaces for Learning
  6. Altmetric Badge
    Chapter 5 State Complexity of Nested Word Automata
  7. Altmetric Badge
    Chapter 6 A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
  8. Altmetric Badge
    Chapter 7 Minimal Union-Free Decompositions of Regular Languages
  9. Altmetric Badge
    Chapter 8 Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
  10. Altmetric Badge
    Chapter 9 Matching Trace Patterns with Regular Policies
  11. Altmetric Badge
    Chapter 10 Absolute Convergence of Rational Series Is Semi-decidable
  12. Altmetric Badge
    Chapter 11 Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
  13. Altmetric Badge
    Chapter 12 Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
  14. Altmetric Badge
    Chapter 13 Refinement and Consistency of Timed Modal Specifications
  15. Altmetric Badge
    Chapter 14 Nondeterministic Instance Complexity and Proof Systems with Advice
  16. Altmetric Badge
    Chapter 15 How Many Holes Can an Unbordered Partial Word Contain?
  17. Altmetric Badge
    Chapter 16 An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
  18. Altmetric Badge
    Chapter 17 Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
  19. Altmetric Badge
    Chapter 18 Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
  20. Altmetric Badge
    Chapter 19 Picture Languages Generated by Assembling Tiles
  21. Altmetric Badge
    Chapter 20 Undecidability of Operation Problems for T0L Languages and Subclasses
  22. Altmetric Badge
    Chapter 21 Decision Problems for Convex Languages
  23. Altmetric Badge
    Chapter 22 On a Family of Morphic Images of Arnoux-Rauzy Words
  24. Altmetric Badge
    Chapter 23 Monadic Datalog Tree Transducers
  25. Altmetric Badge
    Chapter 24 On Extended Regular Expressions
  26. Altmetric Badge
    Chapter 25 Multi-tilde Operators and Their Glushkov Automata
  27. Altmetric Badge
    Chapter 26 Language and Automata Theory and Applications
  28. Altmetric Badge
    Chapter 27 A Cryptosystem Based on the Composition of Reversible Cellular Automata
  29. Altmetric Badge
    Chapter 28 Grammars Controlled by Special Petri Nets
  30. Altmetric Badge
    Chapter 29 Nested Counters in Bit-Parallel String Matching
  31. Altmetric Badge
    Chapter 30 Bounded Delay and Concurrency for Earliest Query Answering
  32. Altmetric Badge
    Chapter 31 Learning by Erasing in Dynamic Epistemic Logic
  33. Altmetric Badge
    Chapter 32 The Fault Tolerance of NP-Hard Problems
  34. Altmetric Badge
    Chapter 33 Termination of Priority Rewriting
  35. Altmetric Badge
    Chapter 34 State Complexity of Combined Operations for Prefix-Free Regular Languages
  36. Altmetric Badge
    Chapter 35 Towards a Taxonomy for ECFG and RRPG Parsing
  37. Altmetric Badge
    Chapter 36 Counting Parameterized Border Arrays for a Binary Alphabet
  38. Altmetric Badge
    Chapter 37 Bounded Hairpin Completion
  39. Altmetric Badge
    Chapter 38 Rigid Tree Automata
  40. Altmetric Badge
    Chapter 39 Converting Self-verifying Automata into Deterministic Automata
  41. Altmetric Badge
    Chapter 40 Two Equivalent Regularizations for Tree Adjoining Grammars
  42. Altmetric Badge
    Chapter 41 Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching
  43. Altmetric Badge
    Chapter 42 Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
  44. Altmetric Badge
    Chapter 43 Automata on Gauss Words
  45. Altmetric Badge
    Chapter 44 Language and Automata Theory and Applications
  46. Altmetric Badge
    Chapter 45 An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
  47. Altmetric Badge
    Chapter 46 Segmentation Charts for Czech – Relations among Segments in Complex Sentences
  48. Altmetric Badge
    Chapter 47 A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
  49. Altmetric Badge
    Chapter 48 Efficiency of the Symmetry Bias in Grammar Acquisition
  50. Altmetric Badge
    Chapter 49 A Series of Run-Rich Strings
  51. Altmetric Badge
    Chapter 50 On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
  52. Altmetric Badge
    Chapter 51 The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates
  53. Altmetric Badge
    Chapter 52 Prediction of Creole Emergence in Spatial Language Dynamics
  54. Altmetric Badge
    Chapter 53 On the Average Size of Glushkov’s Automata
  55. Altmetric Badge
    Chapter 54 Tiling the Plane with a Fixed Number of Polyominoes
  56. Altmetric Badge
    Chapter 55 New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality
  57. Altmetric Badge
    Chapter 56 On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
  58. Altmetric Badge
    Chapter 57 Finitely Generated Synchronizing Automata
  59. Altmetric Badge
    Chapter 58 Genetic Algorithm for Synchronization
  60. Altmetric Badge
    Chapter 59 Constructing Infinite Words of Intermediate Arithmetical Complexity
  61. Altmetric Badge
    Chapter 60 From Gene Trees to Species Trees through a Supertree Approach
  62. Altmetric Badge
    Chapter 61 A Kleene Theorem for Forest Languages
  63. Altmetric Badge
    Chapter 62 Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
  64. Altmetric Badge
    Chapter 63 One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
Overall attention for this book and its chapters
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 (92nd percentile)
  • High Attention Score compared to outputs of the same age and source (97th percentile)

Mentioned by

news
1 news outlet
twitter
3 X users
facebook
1 Facebook page
wikipedia
3 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

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.
Title
Language and Automata Theory and Applications
Published by
ADS, March 2009
DOI 10.1007/978-3-642-00982-2
ISBNs
978-3-64-200981-5, 978-3-64-200982-2
Editors

Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martín-Vide

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 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 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 %
Student > Ph. D. Student 1 33%
Unknown 2 67%
Readers by discipline Count As %
Engineering 1 33%
Unknown 2 67%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 15. 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 25 March 2024.
All research outputs
#2,084,110
of 22,985,065 outputs
Outputs from ADS
#1,240
of 37,423 outputs
Outputs of similar age
#6,532
of 93,215 outputs
Outputs of similar age from ADS
#11
of 374 outputs
Altmetric has tracked 22,985,065 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 90th percentile: it's in the top 10% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 37,423 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done particularly well, scoring higher than 96% 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 93,215 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 92% of its contemporaries.
We're also able to compare this research output to 374 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 97% of its contemporaries.