Automata, Languages and Programming

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 103 Communication complexity of PRAMs
3. Altmetric Badge
   Chapter 104 Average case complexity analysis of the RETE multi-pattern match algorithm
4. Altmetric Badge
   Chapter 105 Problems easy for tree-decomposable graphs extended abstract
5. Altmetric Badge
   Chapter 106 Serializability in distributed systems with handshaking
6. Altmetric Badge
   Chapter 107 Algorithms for planar geometric models
7. Altmetric Badge
   Chapter 108 Nonuniform learnability
8. Altmetric Badge
   Chapter 109 Zeta functions of recognizable languages
9. Altmetric Badge
   Chapter 110 Dynamic programming on graphs with bounded treewidth
10. Altmetric Badge
    Chapter 111 Efficient simulations of simple models of parallel computation by time-bounded ATM's and space-bounded TM's
11. Altmetric Badge
    Chapter 112 Optimal slope selection
12. Altmetric Badge
    Chapter 113 Approximation of a trace, asynchronous automata and the ordering of events in a distributed system
13. Altmetric Badge
    Chapter 114 New techniques for proving the decidability of equivalence problems
14. Altmetric Badge
    Chapter 115 Transitive orientations, möbius functions, and complete semi-thue systems for free partially commutative monoids
15. Altmetric Badge
    Chapter 116 The complexity of matrix transposition on one-tape off-line turing machines with output tape
16. Altmetric Badge
    Chapter 117 Geometric structures in computational geometry
17. Altmetric Badge
    Chapter 118 Arrangements of curves in the plane — topology, combinatorics, and algorithms
18. Altmetric Badge
    Chapter 119 Reset sequences for finite automata with application to design of parts orienters
19. Altmetric Badge
    Chapter 120 Random allocations and probabilistic languages
20. Altmetric Badge
    Chapter 121 Systolic architectures, systems and computations
21. Altmetric Badge
    Chapter 122 New developments in structural complexity theory
22. Altmetric Badge
    Chapter 123 Operational semantics of OBJ-3
23. Altmetric Badge
    Chapter 124 Do we really need to balance patricia tries?
24. Altmetric Badge
    Chapter 125 Contractions in comparing concurrency semantics
25. Altmetric Badge
    Chapter 126 A complexity theory of efficient parallel algorithms
26. Altmetric Badge
    Chapter 127 On the learnability of DNF formulae
27. Altmetric Badge
    Chapter 128 Efficient algorithms on context-free graph languages
28. Altmetric Badge
    Chapter 129 Efficient analysis of graph properties on context-free graph languages
29. Altmetric Badge
    Chapter 130 A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs
30. Altmetric Badge
    Chapter 131 Constructive Hopf's theorem: Or how to untangle closed planar curves
31. Altmetric Badge
    Chapter 132 Maximal dense intervals of grammar forms
32. Altmetric Badge
    Chapter 133 Computations, residuals, and the power of indeterminacy
33. Altmetric Badge
    Chapter 134 Nested annealing: A provable improvement to simulated annealing
34. Altmetric Badge
    Chapter 135 Nonlinear pattern matching in trees
35. Altmetric Badge
    Chapter 136 Invertibility of linear finite automata over a ring
36. Altmetric Badge
    Chapter 137 Moving discs between polygons
37. Altmetric Badge
    Chapter 138 Optimal circuits and transitive automorphism groups
38. Altmetric Badge
    Chapter 139 A Kleene-presburgerian approach to linear production systems
39. Altmetric Badge
    Chapter 140 On minimum flow and transitive reduction
40. Altmetric Badge
    Chapter 141 La Reconnaissance Des Facteurs D'un Langage Fini Dans Un Texte En Temps Lineaire - Resume -
41. Altmetric Badge
    Chapter 142 Regular languages defined with generalized quantifiers
42. Altmetric Badge
    Chapter 143 A dynamic data structure for planar graph embedding
43. Altmetric Badge
    Chapter 144 Separating polynomial-time turing and truth-table reductions by tally sets
44. Altmetric Badge
    Chapter 145 Assertional verification of a timer based protocol
45. Altmetric Badge
    Chapter 146 Type inference with partial types
46. Altmetric Badge
    Chapter 147 Some behavioural aspects of net theory
47. Altmetric Badge
    Chapter 148 The equivalence of dgsm replications on Q-rational languages is decidable
48. Altmetric Badge
    Chapter 149 Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs
49. Altmetric Badge
    Chapter 150 On restricting the access to an NP-oracle
50. Altmetric Badge
    Chapter 151 On ≤ 1−tt p -sparseness and nondeterministic complexity classes
51. Altmetric Badge
    Chapter 152 Semantics for logic programs without occur check
52. Altmetric Badge
    Chapter 153 Outer narrowing for equational theories based on constructors