↓ Skip to main content

Automata, Languages and Programming

Overview of attention for book
Cover of 'Automata, Languages and Programming'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 54 How to get rid of pseudoterminals
  3. Altmetric Badge
    Chapter 55 Test sets for homomorphism equivalence on context free languages
  4. Altmetric Badge
    Chapter 56 Languages with homomorphic replacements
  5. Altmetric Badge
    Chapter 57 Functions equivalent to integer multiplication
  6. Altmetric Badge
    Chapter 58 Languages with reducing reflexive types
  7. Altmetric Badge
    Chapter 59 Semantics of unbounded nondeterminism
  8. Altmetric Badge
    Chapter 60 A shifting algorithm for min-max tree partitioning
  9. Altmetric Badge
    Chapter 61 A characterisation of computable data types by means of a finite equational specification method
  10. Altmetric Badge
    Chapter 62 A note on sweeping automata
  11. Altmetric Badge
    Chapter 63 Border rank of a p×q×2 tensor and the optimal approximation of a pair of bilinear forms
  12. Altmetric Badge
    Chapter 64 Derivations et reductions dans les grammaires algebrioues
  13. Altmetric Badge
    Chapter 65 Semantic analysis of communicating sequential processes
  14. Altmetric Badge
    Chapter 66 Dos systems and languages
  15. Altmetric Badge
    Chapter 67 Algebraic implementation of abstract data types: concept, syntax, semantics and correctness
  16. Altmetric Badge
    Chapter 68 Parameterized data types in algebraic specification languages
  17. Altmetric Badge
    Chapter 69 Characterizing correctness properties of parallel programs using fixpoints
  18. Altmetric Badge
    Chapter 70 Formal properties of one-visit and multi-pass attribute grammars (extended abstract)
  19. Altmetric Badge
    Chapter 71 Cryptocomplexity and NP-completeness
  20. Altmetric Badge
    Chapter 72 On the analysis of tree-matching algorithms
  21. Altmetric Badge
    Chapter 73 Generating and searching sets induced by networks
  22. Altmetric Badge
    Chapter 74 The complexity of the inequivalence problem for regular expressions with intersection
  23. Altmetric Badge
    Chapter 75 An almost linear time algorithm for computing a dependency basis in a relational data base
  24. Altmetric Badge
    Chapter 76 Bipolar synchronization systems
  25. Altmetric Badge
    Chapter 77 Testing of properties of finite algebras
  26. Altmetric Badge
    Chapter 78 A transaction model
  27. Altmetric Badge
    Chapter 79 On observing nondeterminism and concurrency
  28. Altmetric Badge
    Chapter 80 Terminal algebra semantics and retractions for abstract data types
  29. Altmetric Badge
    Chapter 81 The complexity of semilinear sets
  30. Altmetric Badge
    Chapter 82 A theory of nondeterminism
  31. Altmetric Badge
    Chapter 83 A representation theorem for models of *-free PDL
  32. Altmetric Badge
    Chapter 84 Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions
  33. Altmetric Badge
    Chapter 85 Symmertric space-bounded computation (extended abstract)
  34. Altmetric Badge
    Chapter 86 On some properties of local testability
  35. Altmetric Badge
    Chapter 87 Semantics :Algebras,fixed points,axioms
  36. Altmetric Badge
    Chapter 88 Measuring the expressive power of dynamic logics: An application of abstract model theory
  37. Altmetric Badge
    Chapter 89 Pebbling mountain ranges and its application to DCFL-recognition
  38. Altmetric Badge
    Chapter 90 Space-restricted attribute grammars
  39. Altmetric Badge
    Chapter 91 A constructive approach to compiler correctness
  40. Altmetric Badge
    Chapter 92 A worst-case analysis of nearest neighbor searching by projection
  41. Altmetric Badge
    Chapter 93 Proprietes syntactiques du produit non ambigu
  42. Altmetric Badge
    Chapter 94 On the optimal assignment of attributes to passes in multi-pass attribute evaluators
  43. Altmetric Badge
    Chapter 95 Optimal unbounded search strategies
  44. Altmetric Badge
    Chapter 96 A "fast implementation" of a multidimensional storage into a tree storage
  45. Altmetric Badge
    Chapter 97 Grammatical families
  46. Altmetric Badge
    Chapter 98 Partitioned chain grammars
  47. Altmetric Badge
    Chapter 99 An improved program for constructing open hash tables
  48. Altmetric Badge
    Chapter 100 On the power of commutativity in cryptography
  49. Altmetric Badge
    Chapter 101 Characterizations of the LL(k) property
  50. Altmetric Badge
    Chapter 102 Computability in categories
  51. Altmetric Badge
    Chapter 103 On the size complexity of monotone formulas
  52. Altmetric Badge
    Chapter 104 Reversible computing
  53. Altmetric Badge
    Chapter 105 The use of metasystem transition in theorem proving and program optimization
  54. Altmetric Badge
    Chapter 106 On the power of real-time turing machines under varying specifications
Attention for Chapter 81: The complexity of semilinear sets
Altmetric Badge

Mentioned by

twitter
1 tweeter

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
5 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
The complexity of semilinear sets
Chapter number 81
Book title
Automata, Languages and Programming
Published by
Springer, Berlin, Heidelberg, July 1980
DOI 10.1007/3-540-10003-2_81
Book ISBNs
978-3-54-010003-4, 978-3-54-039346-7
Authors

Thiet-Dung Huynh

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 20%
Unknown 4 80%

Demographic breakdown

Readers by professional status Count As %
Professor 1 20%
Student > Ph. D. Student 1 20%
Professor > Associate Professor 1 20%
Student > Bachelor 1 20%
Unknown 1 20%
Readers by discipline Count As %
Computer Science 3 60%
Philosophy 1 20%
Unknown 1 20%