↓ 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 159 Graphical calculi for interaction
  3. Altmetric Badge
    Chapter 160 NP-completeness: A retrospective
  4. Altmetric Badge
    Chapter 161 The LEDA platform for combinatorial and geometric computing
  5. Altmetric Badge
    Chapter 162 The Wadge-Wagner hierarchy of ω-rational sets
  6. Altmetric Badge
    Chapter 163 From chaotic iteration to constraint propagation
  7. Altmetric Badge
    Chapter 164 DNA 2 DNA computations: A potential “killer app”?
  8. Altmetric Badge
    Chapter 165 Tilings and quasiperiodicity
  9. Altmetric Badge
    Chapter 166 Enumerative sequences of leaves in rational trees
  10. Altmetric Badge
    Chapter 167 A completion algorithm for codes with bounded synchronization delay
  11. Altmetric Badge
    Chapter 168 The expressibility of languages and relations by word equations
  12. Altmetric Badge
    Chapter 169 Finite loops recognize exactly the regular open languages
  13. Altmetric Badge
    Chapter 170 An abstract data type for real numbers
  14. Altmetric Badge
    Chapter 171 Recursive computational depth
  15. Altmetric Badge
    Chapter 172 Some bounds on the computational power of piecewise constant derivative systems (extended abstract)
  16. Altmetric Badge
    Chapter 173 Automata, Languages and Programming
  17. Altmetric Badge
    Chapter 174 Computability on the probability measures on the Borel sets of the unit interval
  18. Altmetric Badge
    Chapter 175 Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
  19. Altmetric Badge
    Chapter 176 Results on resource-bounded measure
  20. Altmetric Badge
    Chapter 177 Randomization and nondeterminism are comparable for ordered read-once branching programs
  21. Altmetric Badge
    Chapter 178 Checking properties of polynomials
  22. Altmetric Badge
    Chapter 179 Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
  23. Altmetric Badge
    Chapter 180 Game theoretic analysis of call-by-value computation
  24. Altmetric Badge
    Chapter 181 On modular properties of higher order extensional lambda calculi
  25. Altmetric Badge
    Chapter 182 On explicit substitutions and names (extended abstract)
  26. Altmetric Badge
    Chapter 183 On the dynamics of sharing graphs
  27. Altmetric Badge
    Chapter 184 Minimizing diameters of dynamic trees
  28. Altmetric Badge
    Chapter 185 Improving spanning trees by upgrading nodes
  29. Altmetric Badge
    Chapter 186 Dynamic algorithms for graphs of bounded treewidth
  30. Altmetric Badge
    Chapter 187 The name discipline of uniform receptiveness (extended abstract)
  31. Altmetric Badge
    Chapter 188 On confluence in the π -calculus
  32. Altmetric Badge
    Chapter 189 A proof theoretical approach to communication
  33. Altmetric Badge
    Chapter 190 Solving trace equations using lexicographical normal forms
  34. Altmetric Badge
    Chapter 191 Star-free picture expressions are strictly weaker than first-order logic
  35. Altmetric Badge
    Chapter 192 An algebra-based method to associate rewards with EMPA terms
  36. Altmetric Badge
    Chapter 193 A semantics preserving actor translation
  37. Altmetric Badge
    Chapter 194 Periodic and non-periodic min-max equations
  38. Altmetric Badge
    Chapter 195 Efficient parallel graph algorithms for coarse grained multicomputers and BSP
  39. Altmetric Badge
    Chapter 196 Upper bound on the communication complexity of private information retrieval
  40. Altmetric Badge
    Chapter 197 Computation paths logic: An expressive, yet elementary, process logic
  41. Altmetric Badge
    Chapter 198 Model checking the full modal mu-calculus for infinite sequential processes
  42. Altmetric Badge
    Chapter 199 Symbolic model checking for probabilistic processes
  43. Altmetric Badge
    Chapter 200 On the concentration of the height of binary search trees
  44. Altmetric Badge
    Chapter 201 An improved master theorem for divide-and-conquer recurrences
  45. Altmetric Badge
    Chapter 202 Bisimulation for probabilistic transition systems: A coalgebraic approach
  46. Altmetric Badge
    Chapter 203 Distributed processes and location failures
  47. Altmetric Badge
    Chapter 204 Basic observables for processes
  48. Altmetric Badge
    Chapter 205 Constrained bipartite edge coloring with applications to wavelength routing
  49. Altmetric Badge
    Chapter 206 Colouring paths in directed symmetric trees with applications to WDM routing
  50. Altmetric Badge
    Chapter 207 On-line routing in all-optical networks
  51. Altmetric Badge
    Chapter 208 A complete characterization of the path layout construction problem for ATM networks with given hop count and load
  52. Altmetric Badge
    Chapter 209 Efficiency of asynchronous systems and read arcs in petri nets
  53. Altmetric Badge
    Chapter 210 Bisimulation equivalence is decidable for one-counter processes
  54. Altmetric Badge
    Chapter 211 Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
  55. Altmetric Badge
    Chapter 212 Axiomatizations for the perpetual loop in process algebra
  56. Altmetric Badge
    Chapter 213 Discrete-time control for rectangular hybrid automata
  57. Altmetric Badge
    Chapter 214 Maintaining minimum spanning trees in dynamic graphs
  58. Altmetric Badge
    Chapter 215 Efficient splitting and merging algorithms for order decomposable problems
  59. Altmetric Badge
    Chapter 216 Efficient array partitioning
  60. Altmetric Badge
    Chapter 217 Constructive linear time algorithms for branchwidth
  61. Altmetric Badge
    Chapter 218 The word matching problem is undecidable for finite special string-rewriting systems that are confluent
  62. Altmetric Badge
    Chapter 219 The geometry of orthogonal reduction spaces
  63. Altmetric Badge
    Chapter 220 The theory of vaccines
  64. Altmetric Badge
    Chapter 221 The equivalence problem for deterministic pushdown automata is decidable
  65. Altmetric Badge
    Chapter 222 On recognizable and rational formal power series in partially commuting variables
  66. Altmetric Badge
    Chapter 223 On a conjecture of J. Shallit
  67. Altmetric Badge
    Chapter 224 On characterizations of escrow encryption schemes
  68. Altmetric Badge
    Chapter 225 Randomness-efficient non-interactive zero knowledge
  69. Altmetric Badge
    Chapter 226 Approximation results for the optimum cost chromatic partition problem
  70. Altmetric Badge
    Chapter 227 The minimum color sum of bipartite graphs
  71. Altmetric Badge
    Chapter 228 A primal-dual approach to approximation of node-deletion problems for matroidal properties
  72. Altmetric Badge
    Chapter 229 Independent sets in asteroidal triple-free graphs
  73. Altmetric Badge
    Chapter 230 Refining and compressing abstract domains
  74. Altmetric Badge
    Chapter 231 Labelled reductions, runtime errors, and operational subsumption
  75. Altmetric Badge
    Chapter 232 A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m
  76. Altmetric Badge
    Chapter 233 Recognizability equals definability for partial k -paths
  77. Altmetric Badge
    Chapter 234 Molecular computing, bounded nondeterminism, and efficient recursion
  78. Altmetric Badge
    Chapter 235 Constructing big trees from short sequences
  79. Altmetric Badge
    Chapter 236 Termination of constraint logic programs
  80. Altmetric Badge
    Chapter 237 The expressive power of unique total stable model semantics
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
1 X user
wikipedia
5 Wikipedia pages

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
7 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
Automata, Languages and Programming
Published by
Springer Science & Business Media, June 1997
DOI 10.1007/3-540-63165-8
ISBNs
978-3-54-063165-1, 978-3-54-069194-5
Editors

Degano, Pierpaolo, Gorrieri, Roberto, Marchetti-Spaccamela, Alberto

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

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 3 43%
Student > Doctoral Student 2 29%
Student > Ph. D. Student 2 29%
Readers by discipline Count As %
Arts and Humanities 2 29%
Computer Science 2 29%
Engineering 2 29%
Social Sciences 1 14%