## Automata, Languages and Programming: 2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974. Proceedings |

### What people are saying - Write a review

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

### Contents

MONDAY MORNING | 9 |

Checking stacks and contextfree programmed grammars accept | 27 |

Dynamic programming schemata | 66 |

Copyright | |

9 other sections not shown

### Other editions - View all

### Common terms and phrases

algebraic ALGOL 60 algorithm alphabet applied automata automaton axiom axiomatization binary boucle bound C-R property call-by-value called complexity classes computational complexity consider constant construction contains context-free grammar context-free languages Corollary corresponding defined definition denote derivation deterministic deux diagram domain élément equations equivalent example exists finite set fixed-point formal functor given GN's Goedel numberings GOL system grammar form grammar G grammatical family graph homomorphism indexed grammar induction input integer interpretation isomorphic labelled Lemma lemme Let F linear LR(k markers Markov algorithms matrices maximal monoïde node non-terminal notation obtained occurs operations optimal p-complete pair parameter parser parsing parsing graph peut predicate prefix grammar problem procedure production prefix program schemata programming languages Proof prove pushdown r-graph rationnelle recent property recursive function reduced relation result schema semantics sentential forms sequence stack step string structure subroutine subset substitution symbols tape terminal Theorem theory tion translation Turing machine variables