Acceptance Trees

Abstract

A simple model, AT, for nondeterministic machines is presented which is based on certain types of trees. A set of operations, &Sgr;, is defined over AT and it is shown to be completely characterized by a set of inequations over &Sgr;. AT is used to define the denotational semantics of a language for defining nondeterministic machines. The significance of… (More)
DOI: 10.1145/4221.4249

Topics

7 Figures and Tables

Slides referencing similar topics