abstract
121Abstract syntax tree — In computer science, an abstract syntax tree (AST), or just syntax tree, is a tree representation of the syntax of some source code (that has been written in a programming language). Each node of the tree denotes a construct occurring in the… …
122Abstract Wiener space — An abstract Wiener space is a mathematical object in measure theory, used to construct a decent (strictly positive and locally finite) measure on an infinite dimensional vector space. It is named after the American mathematician Norbert Wiener.… …
123Abstract syntax — The abstract syntax of data is its structure described as a data type (possibly, but not necessarily, an abstract data type), independent of any particular representation or encoding. To be implemented either for computation or communications, a… …
124Abstract State Machine — Eine abstrakte Zustandsmaschine (englisch Abstract State Machine (ASM), ehemals auch Evolving Algebra (EVA) genannt), ist in der Informatik ein Modell zur formalen, operationellen Beschreibung von Algorithmen. Anders als bei endlichen Automaten,… …
125Abstract State Machines — Eine abstrakte Zustandsmaschine (englisch Abstract State Machine (ASM), ehemals auch Evolving Algebra (EVA) genannt), ist in der Informatik ein Modell zur formalen, operationalen Beschreibung von Algorithmen. Anders als bei endlichen Automaten,… …
126Abstract of judgment — United KingdomAn abstract is a brief summary of a judicial judgment, usually written by a Barrister or academic for publication in law reports. Abstracts are of particular use in legal research because they condense the essential points of long,… …
127Abstract state machines — In computer science, an abstract state machine (ASM) is a state machine in which the number of states need not be finite and in which the states are not mere points in the state space. More precisely, an ASM state is a structure in the sense of… …
128Abstract family of acceptors — An abstract family of acceptors (AFA) is a grouping of generalized acceptors. Informally, an acceptor is a device with a finite state control, a finite number of input symbols, and an internal store with a read and write function. Each acceptor… …
