Handbook of Theoretical Computer SciencePresents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced information processing. |
Wat mensen zeggen - Een review schrijven
We hebben geen reviews gevonden op de gebruikelijke plaatsen.
Inhoudsopgave
PREFACE V | 3 |
Rational expressions | 11 |
Starheight | 19 |
Copyright | |
27 andere gedeelten niet getoond
Overige edities - Alles bekijken
Veelvoorkomende woorden en zinsdelen
abstract algebra algorithm application assignment assume automata automaton axioms Berlin bound calculus called complete Computer Science consider consists construction contains context-free continuous correctness corresponding decidable defined definition denote derivation domain elements equations equivalent example execution exists expressions extended fact finite first-order fixed formal formula function give given grammar graph ground Hence Hoare holds implementation induction infinite initial interpretation introduced lambda least Lecture Notes Lemma logic mapping mathematical means method multiset natural Notes in Computer notion obtained operations ordering pair partial possible presentation problem Proc procedure programming languages proof properties PROPOSITION prove recursive reduction regular relation result rewriting rule satisfying semantics sequence signature sort specification Springer step structure subset substitution symbols term terminal Theorem theory tree true variables write