Automata, Languages and Programming

algebra algorithm application attributes automata axiom binary tree Boolean bounded CLOCK-CHANNEL complete Computer Science configuration consider construction contains context-free context-free grammar context-free languages Corollary data type data-flow database decidable decision problems defined definition denote derivation deterministic dpda DPDL edges embedded equations equivalence problem exists Exptime finite FL(po formal formula function given GOTO grammar graph Hoare logic homomorphisms hypergraph implies induction infinite input integer join dependency LALR(k language Lemma linear LL(k LR(k method monoïdes moves multivalued dependencies node nondeterministic nonnegative nonterminal normal form NP-complete obtained operations parser polynomial predicate prefix Proc procedure proof Proposition prove pushdown recursive result rule s-t cut satisfies semantics sequence simulation specification stack string structure subset symbols t₁ terminal Theorem theory tuples universal relation variables variété viable prefix W-LOSE zero