## Automata, Languages and Programming: 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Comparison oi algorithms controlling concurrent access to a database | 11 |

A KverbutJi 1 Galil S Uinograd | 37 |

A Borodin F E Pick F tieyer aui der Heide E Upial A ttigdexson | 50 |

Copyright | |

21 other sections not shown

### Other editions - View all

### Common terms and phrases

accepted algebra algorithm alternating Turing machines automata automaton biconnected binary Boolean closure complete languages complexity classes Computer Science concurrent condition consider construction contains context-free languages Corollary corresponding critical pairs cutwidth cycle defined definition denote detection deterministic digraph edges elements equations equivalence relation example exists exponential finite function given global hierarchy idempotent implies induction infinite initial input integer Kolmogorov complexity Lemma length linear lower bound messages monoid node nondeterministic nontermination NP-complete NTIME obtained operations oracle oracle Turing machine output paper parallel path planar planar graphs polynomial polynomial-time problem Proc procedure processors proof properties Proposition prove PUNC queries rational real numbers recognizable recursive reduced restricted result rules satisfying semigroupes simulation space stack step strings structure subset term rewriting system termination ternary Theorem theory tree Turing machine update variables vector vertex vertices words