102,220 Result(s)
-
Article
The programming language pascal
A programming language called Pascal is described which was developed on the basis ofAlgol 60. Compared toAlgol 60, its range of applicability is considerably increased due to a variety of data structuring facili...
-
Article
Optimum binary search trees
-
Article
A model for data structures and its applications. I
This paper presents a constructive model for data structures description based on the concept of data space defined as the Cartesian product of a name space and a value space. The subsets of name space are ord...
-
Article
Performance predictions for extended paged memories
This paper concerns the problem of obtaining predictions of the extent to which additional core storage would improve the performance of a given paging system based on information that could be obtained from m...
-
Article
Ein Vollständigkeitssatz für Programme und Schaltkreise
Formal transformations of programs or switching circuits can be described by a system of relations within the concept of free X-categories. In this theory the programs or switching circuits are the morphisms o...
-
Article
Top-down syntax analysis
The theory and practice of classical “top-down” parsing methods is presented in a tutorial manner.
-
Article
Optimal merging of 2 elements with n elements
-
Article
Hierarchical ordering of sequential processes
One of the primary functions of an operating system is to rebuild a machine that must be regarded as non-deterministic (on account of cycle stealing and interrupts) into a more or less deterministic automaton....
-
Article
Schnelle Berechnung von Kettenbruchentwicklungen
A method, given by D. E. Knuth for the computation of the greatest common divisor of two integers u, v and of the continued fraction for u/v is modified in such a way that only O(n(lg n)2(lglg n)) elementary step...
-
Article
Application of regular canonical systems to grammars translatable from left to right
-
Article
Congruences et Automorphismes des Automates Finis
We study a class of congruences of strongly connected finite automata, called the group congruences, which may be defined in this way: every element fixing any class of the congruence induces a permutation on ...
-
Article
A comparison of two synchronizing concepts
In this paper the use of semaphores and critical regions to synchronize concurrent processes is compared to a more recent proposal for so-called conditional critical regions. The latter concept permits the pro...
-
Article
Program proving: Jumps and functions
Proof methods adequate for a wide range of computer programs have been expounded in [1] and [2]. This paper develops a method suitable for programs containing functions, and a certain kind Of jump. The method ...
-
Article
Optimum binary search trees
-
Article
Direction controlled programmed grammars
A generalization of the notion of a context-free grammar is presented here. It is based on the notion of a programmed grammar. When the underlying context-free rules do not contain erasing, the class of langua...
-
Article
Organization and maintenance of large ordered indexes
Organization and maintenance of an index for a dynamic random access file is considered. It is assumed that the index must be kept on some pseudo random access backup store like a disc or a drum. The index org...
-
Article
Optimal scheduling for two-processor systems
Despite the recognized potential of multiprocessing little is known concerning the general problem of finding efficient algorithms which compute minimallength schedules for given computations and m≧2 processor...
-
Article
Der programmierbare endliche automat
The paper deals with finite automata with two tapes, the second tape of which is interpreted as programme tape. For fixed automata those classes: of languages are considered, which can be accepted by variation...
-
Article
Inhibitionsfelder
The neurons in the retina of mammals are linked by a system of circuit, such that they influence one another (lateral interaction). The great majority of circuits has got an inhibitory character. F. Ratliff an...
-
Article
Automatic analysis of inflectional morphems in German nouns
The underlying algorithm can be used for automatic indexing. It is supposed to analyze every inflected German noun automatically by reducing it to its proper standard form and by distinguishing every inflected...
