↓ 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 57 Program result checking: A new approach to making programs more reliable
  3. Altmetric Badge
    Chapter 58 Automata, Languages and Programming
  4. Altmetric Badge
    Chapter 59 Searching among intervals and compact routing tables
  5. Altmetric Badge
    Chapter 60 The approximation of maximum subgraph problems
  6. Altmetric Badge
    Chapter 61 Polynomially bounded minimization problems which are hard to approximate
  7. Altmetric Badge
    Chapter 62 Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
  8. Altmetric Badge
    Chapter 63 The complexity of approximating PSPACE-complete problems for hierarchical specifications
  9. Altmetric Badge
    Chapter 64 Problems on pairs of trees and the four colour problem of planar graphs
  10. Altmetric Badge
    Chapter 65 Constructing competitive tours from local information
  11. Altmetric Badge
    Chapter 66 Treewidth and pathwidth of permutation graphs
  12. Altmetric Badge
    Chapter 67 A theory of even functionals and their algorithmic applications
  13. Altmetric Badge
    Chapter 68 Exact asymptotics of divide-and-conquer recurrences
  14. Altmetric Badge
    Chapter 69 Optimal bounds for the change-making problem
  15. Altmetric Badge
    Chapter 70 The complexity of N -body simulation
  16. Altmetric Badge
    Chapter 71 A simple method for resolving degeneracies in Delaunay triangulations
  17. Altmetric Badge
    Chapter 72 Fault-tolerance and complexity (Extended abstract)
  18. Altmetric Badge
    Chapter 73 Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines
  19. Altmetric Badge
    Chapter 74 On the computational power of discrete Hopfield nets
  20. Altmetric Badge
    Chapter 75 On randomized versus deterministic computation
  21. Altmetric Badge
    Chapter 76 Lower bounds for one-way probabilistic communication complexity
  22. Altmetric Badge
    Chapter 77 Maintaining discrete probability distributions optimally
  23. Altmetric Badge
    Chapter 78 Secure and efficient off-line digital money (extended abstract)
  24. Altmetric Badge
    Chapter 79 Computational depth and reducibility
  25. Altmetric Badge
    Chapter 80 Learnability: Admissible, co-finite, and hypersimple languages
  26. Altmetric Badge
    Chapter 81 Inclusion is undecidable for pattern languages
  27. Altmetric Badge
    Chapter 82 New decidability results concerning two-way counter machines and applications
  28. Altmetric Badge
    Chapter 83 Cobham's Theorem seen through Büchi's Theorem
  29. Altmetric Badge
    Chapter 84 Logical definability on infinite traces
  30. Altmetric Badge
    Chapter 85 Algebras for classifying regular tree languages and an application to frontier testability
  31. Altmetric Badge
    Chapter 86 Finite automata as characterizations of minor closed tree families (extended abstract)
  32. Altmetric Badge
    Chapter 87 On distributed algorithms in a broadcast domain
  33. Altmetric Badge
    Chapter 88 Sparse networks supporting efficient reliable broadcasting
  34. Altmetric Badge
    Chapter 89 Strongly adaptive token distribution
  35. Altmetric Badge
    Chapter 90 Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
  36. Altmetric Badge
    Chapter 91 Fast parallel constraint satisfaction
  37. Altmetric Badge
    Chapter 92 The product of rational languages
  38. Altmetric Badge
    Chapter 93 On regular compatibility of semi-commutations
  39. Altmetric Badge
    Chapter 94 Algebraic aspects of B-regular series
  40. Altmetric Badge
    Chapter 95 Products of finite state machines with full coverage
  41. Altmetric Badge
    Chapter 96 An effective version of Stallings' theorem in the case of context-free groups
  42. Altmetric Badge
    Chapter 97 On the power of periodic iteration of morphisms
  43. Altmetric Badge
    Chapter 98 If a DOL language is k-power free then it is circular
  44. Altmetric Badge
    Chapter 99 Deciding true concurrency equivalences on finite safe nets (preliminary report)
  45. Altmetric Badge
    Chapter 100 Timed testing of concurrent systems
  46. Altmetric Badge
    Chapter 101 The fork calculus
  47. Altmetric Badge
    Chapter 102 Extended transition systems for parametric bisimulation
  48. Altmetric Badge
    Chapter 103 Temporal logic and categories of Petri nets
  49. Altmetric Badge
    Chapter 104 Decidability of a partial order based temporal logic
  50. Altmetric Badge
    Chapter 105 Local model checking for context-free processes
  51. Altmetric Badge
    Chapter 106 Computing on structures
  52. Altmetric Badge
    Chapter 107 A partial solution for D -unification based on a reduction to AC 1 -unification
  53. Altmetric Badge
    Chapter 108 Efficient analysis of concurrent constraint logic programs
  54. Altmetric Badge
    Chapter 109 A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object
  55. Altmetric Badge
    Chapter 110 Modularity of termination and confluence in combinations of rewrite systems with λ ω
  56. Altmetric Badge
    Chapter 111 From domains to automata with concurrency
  57. Altmetric Badge
    Chapter 112 What is a universal higher-order programming language?
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
6 Wikipedia pages
q&a
1 Q&A thread

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
18 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 1993
DOI 10.1007/3-540-56939-1
ISBNs
978-3-54-056939-8, 978-3-54-047826-3
Editors

Lingas, Andrzej, Karlsson, Rolf, Carlsson, Svante

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

Geographical breakdown

Country Count As %
Unknown 18 100%

Demographic breakdown

Readers by professional status Count As %
Lecturer 1 6%
Unknown 17 94%
Readers by discipline Count As %
Computer Science 1 6%
Unknown 17 94%