↓ Skip to main content
What is this page? Embed badge

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 58 Theory of 2-structures
  3. Altmetric Badge
    Chapter 59 A domain for concurrent termination a generalization of Mazurkiewicz traces
  4. Altmetric Badge
    Chapter 60 Nonfinite axiomatizability of the equational theory of shuffle
  5. Altmetric Badge
    Chapter 61 The algebraic equivalent of AFL theory
  6. Altmetric Badge
    Chapter 62 Finite state transformations of images
  7. Altmetric Badge
    Chapter 63 Post correspondence problem: Words possible as primitive solutions
  8. Altmetric Badge
    Chapter 64 Computing the closure of sets of words under partial commutations
  9. Altmetric Badge
    Chapter 65 Intervalizing k -colored graphs
  10. Altmetric Badge
    Chapter 66 NC algorithms for finding a maximal set of paths with application to compressing strings
  11. Altmetric Badge
    Chapter 67 On the construction of classes of suffix trees for square matrices: Algorithms and applications
  12. Altmetric Badge
    Chapter 68 How to use the minimal separators of a graph for its chordal triangulation
  13. Altmetric Badge
    Chapter 69 Fast gossiping by short messages
  14. Altmetric Badge
    Chapter 70 Break Finite Automata Public Key Cryptosystem
  15. Altmetric Badge
    Chapter 71 Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
  16. Altmetric Badge
    Chapter 72 On the number of random bits in totally private computation
  17. Altmetric Badge
    Chapter 73 Lower time bounds for randomized computation
  18. Altmetric Badge
    Chapter 74 New collapse consequences of NP having small circuits
  19. Altmetric Badge
    Chapter 75 The complexity of searching succinctly represented graphs
  20. Altmetric Badge
    Chapter 76 Optimal shooting: Characterizations and applications
  21. Altmetric Badge
    Chapter 77 Placing resources in a tree: Dynamic and static algorithms
  22. Altmetric Badge
    Chapter 78 Shortest path queries in digraphs of small treewidth
  23. Altmetric Badge
    Chapter 79 A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
  24. Altmetric Badge
    Chapter 80 Parallel algorithms with optimal speedup for bounded treewidth
  25. Altmetric Badge
    Chapter 81 Approximating minimum cuts under insertions
  26. Altmetric Badge
    Chapter 82 Linear time algorithms for dominating pairs in asteroidal triple-free graphs
  27. Altmetric Badge
    Chapter 83 On-line resource management with applications to routing and scheduling
  28. Altmetric Badge
    Chapter 84 Alternation in simple devices
  29. Altmetric Badge
    Chapter 85 Hybrid automata with finite bisimulations
  30. Altmetric Badge
    Chapter 86 Generalized Sturmian languages
  31. Altmetric Badge
    Chapter 87 Polynomial closure and unambiguous product
  32. Altmetric Badge
    Chapter 88 Lower bounds on algebraic random access machines
  33. Altmetric Badge
    Chapter 89 Improved deterministic PRAM simulation on the mesh
  34. Altmetric Badge
    Chapter 90 On optimal polynomial time approximations: P-levelability vs. δ-levelability
  35. Altmetric Badge
    Chapter 91 Weakly useful sequences
  36. Altmetric Badge
    Chapter 92 Graph Connectivity, Monadic NP and built-in relations of moderate degree
  37. Altmetric Badge
    Chapter 93 The expressive power of clocks
  38. Altmetric Badge
    Chapter 94 Grammar systems: A grammatical approach to distribution and cooperation
  39. Altmetric Badge
    Chapter 95 Compactness of systems of equations in semigroups
  40. Altmetric Badge
    Chapter 96 Sensing versus nonsensing automata
  41. Altmetric Badge
    Chapter 97 New upper bounds for generalized intersection searching problems
  42. Altmetric Badge
    Chapter 98 OKFDDs versus OBDDs and OFDDs
  43. Altmetric Badge
    Chapter 99 Bicriteria network design problems
  44. Altmetric Badge
    Chapter 100 On determining optimal strategies in pursuit games in the plane
  45. Altmetric Badge
    Chapter 101 Extension orderings
  46. Altmetric Badge
    Chapter 102 The pushdown method to optimize chain logic programs
  47. Altmetric Badge
    Chapter 103 Automatic synthesis of real time systems
  48. Altmetric Badge
    Chapter 104 Self-correcting for function fields of finite transcendental degree
  49. Altmetric Badge
    Chapter 105 Measure, category and learning theory
  50. Altmetric Badge
    Chapter 106 A characterization of the existence of energies for neural networks
  51. Altmetric Badge
    Chapter 107 Variable-length codes for error correction
  52. Altmetric Badge
    Chapter 108 Graphbots: Mobility in discrete spaces
  53. Altmetric Badge
    Chapter 109 Solving recursive net equations
  54. Altmetric Badge
    Chapter 110 Implicit definability and infinitary logic in finite model theory
  55. Altmetric Badge
    Chapter 111 The limit of split n -language equivalence
  56. Altmetric Badge
    Chapter 112 Divergence and fair testing
  57. Altmetric Badge
    Chapter 113 Causality for mobile processes
  58. Altmetric Badge
    Chapter 114 Internal mobility and agent-passing calculi
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
Summary X
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-60084-1
ISBNs
978-3-54-060084-8, 978-3-54-049425-6
Editors

Fülöp, Zoltán, Gécseg, Ferenc

View on publisher site
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.

This page is provided by Altmetric.