## Automata, languages, and programming: 11th colloquium, Antwerp, Belgium, July 16-20, 1984 |

### What people are saying - Write a review

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

### Contents

Computer Aided Design Modelling Systems Engineering Vol 118 Mathematical Foundations of Computer Science 1981 | 23 |

S Abiteboul and S Ginsburg | 41 |

F Afrati C H Papadimitriou and G Papageorgiou | 51 |

Copyright | |

20 other sections not shown

### Common terms and phrases

algebraic algorithm assume automata automaton axiom system block bounded cartesian closed categories cl-regular clause coarsest partition communication complexity complete Computer Science configuration congruence consider construction Corollary corresponding cubical graph cycle database defined definition denote derivation deterministic DMSG domain edges elements equations equivalent example exists facteurs FIFO finite given graph hence Herbrand Herbrand base implication problem implies inference rules infinite input integer inverse IREQ join dependency labelled language Lemma linear logic program matrix maximum weight matching monoid morphism multivalued dependencies MVDs NFDs node nondeterministic NP-complete NTIME occurrence operations optimal oracle oracle machine permutation polynomial presortedness priority network probabilistic Proc proof Proposition prove pushdown recursive result satisfies semantics semigroups sequence simulation stack step subset subword superincreasing sequences Symp syntactic monoid Theorem tree tuple Turing machines update variables vertex vertices VLSI