Automata, Languages and Programming

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 53 Unexpected upper bounds on the complexity of some communication games
3. Altmetric Badge
   Chapter 54 Valuations and unambiguity of languages, with applications to fractal geometry
4. Altmetric Badge
   Chapter 55 On the computational power of probabilistic and faulty neural networks
5. Altmetric Badge
   Chapter 56 Deciding properties of integral relational automata
6. Altmetric Badge
   Chapter 57 On the cost of recomputing: tight bounds on pebbling with faults
7. Altmetric Badge
   Chapter 58 On some relations between dynamical systems and transition systems
8. Altmetric Badge
   Chapter 59 Complexity results for multi-pebble automata and their logics
9. Altmetric Badge
   Chapter 60 An analysis of the Core-ML language: Expressive power and type reconstruction
10. Altmetric Badge
    Chapter 61 Expressiveness of efficient semi-deterministic choice constructs
11. Altmetric Badge
    Chapter 62 Tailoring recursion for complexity
12. Altmetric Badge
    Chapter 63 Determinizing asynchronous automata
13. Altmetric Badge
    Chapter 64 On the complementation of Büchi asynchronous cellular automata
14. Altmetric Badge
    Chapter 65 Distribution and locality of concurrent systems
15. Altmetric Badge
    Chapter 66 Liveness in timed and untimed systems
16. Altmetric Badge
    Chapter 67 Average-case analysis of pattern-matching in trees under the BST probability model
17. Altmetric Badge
    Chapter 68 On the approximation of shortest common supersequences and longest common subsequences
18. Altmetric Badge
    Chapter 69 Optimal parallel algorithms for Prefix Matching
19. Altmetric Badge
    Chapter 70 Optimal two-dimensional compressed matching
20. Altmetric Badge
    Chapter 71 Maintaining spanning trees of small diameter
21. Altmetric Badge
    Chapter 72 Simple fast parallel hashing
22. Altmetric Badge
    Chapter 73 The Optimal Alphabetic Tree problem revisited
23. Altmetric Badge
    Chapter 74 On the cutting edge of relativization: The resource bounded injury method
24. Altmetric Badge
    Chapter 75 PSPACE-completeness of certain algorithmic problems on the subgroups of free groups
25. Altmetric Badge
    Chapter 76 Higher-order processes and their models
26. Altmetric Badge
    Chapter 77 Efficient local correctness checking for single and alternating boolean equation systems
27. Altmetric Badge
    Chapter 78 Undecidable verification problems for programs with unreliable channels
28. Altmetric Badge
    Chapter 79 Reasoning about programs by exploiting the environment
29. Altmetric Badge
    Chapter 80 A model of intuitionistic affine logic from stable domain theory
30. Altmetric Badge
    Chapter 81 Automata, Languages and Programming
31. Altmetric Badge
    Chapter 82 Equivalences for fair Kripke structures
32. Altmetric Badge
    Chapter 83 Generalizing finiteness conditions of labelled transition systems
33. Altmetric Badge
    Chapter 84 A kleene theorem for recognizable languages over concurrency monoids
34. Altmetric Badge
    Chapter 85 Least solutions of equations over N
35. Altmetric Badge
    Chapter 86 Fast uniform analysis of Coupled-Context-Free languages
36. Altmetric Badge
    Chapter 87 Polynomial closure of group languages and open sets of the Hall topology
37. Altmetric Badge
    Chapter 88 Pumping, cleaning and symbolic constraints solving
38. Altmetric Badge
    Chapter 89 Dynamically-typed computations for order-sorted equational presentations
39. Altmetric Badge
    Chapter 90 Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
40. Altmetric Badge
    Chapter 91 On the theory of interconnection networks for parallel computers
41. Altmetric Badge
    Chapter 92 Multiway cuts in directed and node weighted graphs
42. Altmetric Badge
    Chapter 93 A fast randomized LOGSPACE algorithm for graph connectivity
43. Altmetric Badge
    Chapter 94 Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
44. Altmetric Badge
    Chapter 95 The size of an intertwine
45. Altmetric Badge
    Chapter 96 Finding even cycles even faster
46. Altmetric Badge
    Chapter 97 Polynomial time analysis of toroidal periodic graphs
47. Altmetric Badge
    Chapter 98 A tight lower bound for primitivity in k -structures
48. Altmetric Badge
    Chapter 99 Randomness in distribution protocols
49. Altmetric Badge
    Chapter 100 Lower space bounds for randomized computation
50. Altmetric Badge
    Chapter 101 The average case complexity of the parallel prefix problem
51. Altmetric Badge
    Chapter 102 Prefix codes: Equiprobable words, unequal letter costs
52. Altmetric Badge
    Chapter 103 A super-logarithmic lower bound for hypercubic sorting networks
53. Altmetric Badge
    Chapter 104 Efficient strategies for robot navigation in unknown environment