↓ 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 121 On the semantics of logic programs
  3. Altmetric Badge
    Chapter 122 Logic programming with recurrence domains
  4. Altmetric Badge
    Chapter 123 Extensional embedding of a strongly stable model of PCF
  5. Altmetric Badge
    Chapter 124 Automata, Languages and Programming
  6. Altmetric Badge
    Chapter 125 Logical and computational aspects of programming with sets/bags/lists
  7. Altmetric Badge
    Chapter 126 Safety for branching time semantics
  8. Altmetric Badge
    Chapter 127 Program composition and modular verification
  9. Altmetric Badge
    Chapter 128 Model-checking for probabilistic real-time systems
  10. Altmetric Badge
    Chapter 129 Computing behavioural relations, logically
  11. Altmetric Badge
    Chapter 130 The power of reconfiguration
  12. Altmetric Badge
    Chapter 131 General resolution of tseitin formulas is hard
  13. Altmetric Badge
    Chapter 132 Program checkers for probability generation
  14. Altmetric Badge
    Chapter 133 Running time to recognize nonregular languages by 2-way probabilistic automata
  15. Altmetric Badge
    Chapter 134 Statistics on random trees
  16. Altmetric Badge
    Chapter 135 The expressive power of implicit specifications
  17. Altmetric Badge
    Chapter 136 CCS + time = an interleaving model for real time systems
  18. Altmetric Badge
    Chapter 137 On confluent semi-commutations — Decidability and complexity results
  19. Altmetric Badge
    Chapter 138 Lazard's factorizations of free partially commutative monoids
  20. Altmetric Badge
    Chapter 139 A Kleene theorem for infinite trace languages
  21. Altmetric Badge
    Chapter 140 Canonical sets of horn clauses
  22. Altmetric Badge
    Chapter 141 A specialized completion procedure for monadic string-rewriting systems presenting groups
  23. Altmetric Badge
    Chapter 142 A confluent reduction for the λ-calculus with surjective pairing and terminal object
  24. Altmetric Badge
    Chapter 143 Provably recursive programs and program extraction
  25. Altmetric Badge
    Chapter 144 Efficient algorithms for path problems with general cost criteria
  26. Altmetric Badge
    Chapter 145 Computing shortest paths and distances in planar graphs
  27. Altmetric Badge
    Chapter 146 Maintaining biconnected components of dynamic planar graphs
  28. Altmetric Badge
    Chapter 147 Efficient maximal cubic graph cuts
  29. Altmetric Badge
    Chapter 148 Structural parallel algorithmics
  30. Altmetric Badge
    Chapter 149 Improving known solutions is hard
  31. Altmetric Badge
    Chapter 150 Collapsing degrees via strong computation
  32. Altmetric Badge
    Chapter 151 Fast parallel generation of random permutations
  33. Altmetric Badge
    Chapter 152 A parallel algorithm for two processors precedence constraint scheduling
  34. Altmetric Badge
    Chapter 153 An efficient NC algorithm for finding Hamiltonian cycles in dense directed graphs
  35. Altmetric Badge
    Chapter 154 On logics, tilings, and automata
  36. Altmetric Badge
    Chapter 155 Satisfiability of systems of ordinal notations with the subterm property is decidable
  37. Altmetric Badge
    Chapter 156 Complete axiomatizations of some quotient term algebras
  38. Altmetric Badge
    Chapter 157 The meaning of negative premises in transition system specifications
  39. Altmetric Badge
    Chapter 158 Deciding history preserving bisimilarity
  40. Altmetric Badge
    Chapter 159 Adding action refinement to a finite process algebra
  41. Altmetric Badge
    Chapter 160 Improved parallel computations with matrices and polynomials
  42. Altmetric Badge
    Chapter 161 Finding minimal forbidden minors using a finite congruence
  43. Altmetric Badge
    Chapter 162 Better algorithms for the pathwidth and treewidth of graphs
  44. Altmetric Badge
    Chapter 163 Two P-complete problems in the theory of the reals
  45. Altmetric Badge
    Chapter 164 L morphisms: Bounded delay and regularity of ambiguity
  46. Altmetric Badge
    Chapter 165 Degree and decomposability of variable-length codes
  47. Altmetric Badge
    Chapter 166 An EILENBERG theorem for ∞-languages
  48. Altmetric Badge
    Chapter 167 Balancing order and chaos in image generation
  49. Altmetric Badge
    Chapter 168 Average case complexity
  50. Altmetric Badge
    Chapter 169 Minimal NFA problems are hard
  51. Altmetric Badge
    Chapter 170 Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language
  52. Altmetric Badge
    Chapter 171 Computing shortest transversals
  53. Altmetric Badge
    Chapter 172 Ray shooting in polygons using geodesic triangulations
  54. Altmetric Badge
    Chapter 173 The expected extremes in a delaunay triangulation
  55. Altmetric Badge
    Chapter 174 Computational geometry for the gourmet old fare and new dishes
  56. Altmetric Badge
    Chapter 175 On the power of multiple reads in a chip
  57. Altmetric Badge
    Chapter 176 On linear decision trees computing Boolean functions
  58. Altmetric Badge
    Chapter 177 An almost linear-time algorithm for the dense subset-sum problem
  59. Altmetric Badge
    Chapter 178 On-line algorithms for weighted bipartite matching and stable marriages
  60. Altmetric Badge
    Chapter 179 String matching with preprocessing of text and pattern
  61. Altmetric Badge
    Chapter 180 Ordering problems approximated: single-processor scheduling and interval graph completion
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
q&a
1 Q&A thread

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
17 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 Berlin Heidelberg, January 2006
DOI 10.1007/3-540-54233-7
ISBNs
978-3-54-054233-9, 978-3-54-047516-3
Editors

Albert, Javier Leach, Monien, Burkhard, Artalejo, Mario Rodríguez

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

Geographical breakdown

Country Count As %
Spain 1 6%
France 1 6%
United States 1 6%
Unknown 14 82%

Demographic breakdown

Readers by professional status Count As %
Researcher 8 47%
Student > Ph. D. Student 4 24%
Other 3 18%
Professor 1 6%
Lecturer > Senior Lecturer 1 6%
Other 0 0%
Readers by discipline Count As %
Agricultural and Biological Sciences 11 65%
Physics and Astronomy 3 18%
Biochemistry, Genetics and Molecular Biology 1 6%
Computer Science 1 6%
Unspecified 1 6%
Other 0 0%