Automata, Languages and Programming

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Probability and plurality for aggregations of learning machines
3. Altmetric Badge
   Chapter 2 Logic programming with ions
4. Altmetric Badge
   Chapter 3 Inverse image analysis
5. Altmetric Badge
   Chapter 4 A unification algorithm for confluent theories
6. Altmetric Badge
   Chapter 5 On the Knuth-Bendix completion for concurrent processes
7. Altmetric Badge
   Chapter 6 On word problems in equational theories
8. Altmetric Badge
   Chapter 7 Semantics for nondeterministic asynchronous broadcast networks
9. Altmetric Badge
   Chapter 8 Another look at abstraction in process algebra
10. Altmetric Badge
    Chapter 9 A timed failures model for extended communicating processes
11. Altmetric Badge
    Chapter 10 Readiness semantics for regular processes with silent actions
12. Altmetric Badge
    Chapter 11 Verifying a protocol using relativized bisimulation
13. Altmetric Badge
    Chapter 12 On recent trends in formal language theory
14. Altmetric Badge
    Chapter 13 Non-uniform automata over groups
15. Altmetric Badge
    Chapter 14 Minimal automaton of a rational cover
16. Altmetric Badge
    Chapter 15 A star-height problem in free monoids with partial commutations
17. Altmetric Badge
    Chapter 16 Single-valued finite transduction
18. Altmetric Badge
    Chapter 17 The kleene and the Parikh Theorem in complete semirings
19. Altmetric Badge
    Chapter 18 An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs
20. Altmetric Badge
    Chapter 19 On the languages accepted by finite reversible automata
21. Altmetric Badge
    Chapter 20 Decision problems for regular trace languages
22. Altmetric Badge
    Chapter 21 Panic mode without panic
23. Altmetric Badge
    Chapter 22 Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
24. Altmetric Badge
    Chapter 23 Modelchecking of CTL formulae under liveness assumptions
25. Altmetric Badge
    Chapter 24 A modal logic for a subclass of event structures
26. Altmetric Badge
    Chapter 25 Parallel 5-colouring of planar graphs
27. Altmetric Badge
    Chapter 26 Parallel construction of a suffix tree
28. Altmetric Badge
    Chapter 27 The probabilistic and deterministic parallel complexity of symmetric functions
29. Altmetric Badge
    Chapter 28 Term matching on parallel computers
30. Altmetric Badge
    Chapter 29 Guessing games and distributed computations in synchronous networks
31. Altmetric Badge
    Chapter 30 On the bivariate function minimization problem and its applications to motion planning
32. Altmetric Badge
    Chapter 31 Testing the necklace condition for Shortest Tours and optimal factors in the plane
33. Altmetric Badge
    Chapter 32 Nearly optimal heuristics for binary search trees with geometric generalizations
34. Altmetric Badge
    Chapter 33 Approximating integer lattices by lattices with cyclic factor groups
35. Altmetric Badge
    Chapter 34 On the complexity of graph critical uncolorability
36. Altmetric Badge
    Chapter 35 Posets, boolean representations and quick path searching
37. Altmetric Badge
    Chapter 36 The lexicographically first maximal subgraph problems: P-completeness and NC algorithms
38. Altmetric Badge
    Chapter 37 Uniform computational complexity of Taylor series
39. Altmetric Badge
    Chapter 38 Efficient on-line algorithms for the knapsack problem
40. Altmetric Badge
    Chapter 39 Lower bounds for sorting of sums
41. Altmetric Badge
    Chapter 40 The I/O complexity of sorting and related problems
42. Altmetric Badge
    Chapter 41 A lower bound for the complexity of the Union-Split-Find problem
43. Altmetric Badge
    Chapter 42 The nearest common ancestor in a dynamic tree
44. Altmetric Badge
    Chapter 43 A generalization of the procedure of karp and miller to well structured transition systems
45. Altmetric Badge
    Chapter 44 Completeness results for reachability, containment, and equivalence, with respect to conflict-free vector replacement systems
46. Altmetric Badge
    Chapter 45 Partial algebras flow from algebraic specifications
47. Altmetric Badge
    Chapter 46 The logarithmic alternation hierarchy collapses: $$A\Sigma _2^\mathcal{L} = A\Pi _2^\mathcal{L}$$
48. Altmetric Badge
    Chapter 47 Testing membership in commutative transformation semigroups
49. Altmetric Badge
    Chapter 48 On the computing power of one-way cellular arrays
50. Altmetric Badge
    Chapter 49 Recent developments in the theory of learning