Showing papers in "Information Processing Letters in 1977"

TL;DR: This note shows that the second objection can be amended by combining some ideas used before in [2], and the present and previous results are expressed by the following lemma’s and theorem.

TL;DR: It is shown that a straightforward generalization of the Sankoff algorithm will provide a solution to the tree-to-tree editing problem and it follows that the algorithm must be optimal over a wide class of computation models.

TL;DR: The purpose is to give an algorithm for thz! two dimensional case, one which follows the general approach of the K MP, and indeed uses the KMP as a subprogram, which has a running time of 0(n2 + m’), which is clearly optimal since both the pattern and the text have to be read and this takes O(rt’ + m2).

TL;DR: A quadratic application of binary search yields a variant of conventional interpolation search that is easily shown to use about 2.4 lg lg n probes on the average, andine analysis of this variant requires only a simple argument, and the most

TL;DR: In this article, the authors present an alternate, simpler simulation algorithm which involves consideration only of the configurations actually reached by the automaton, which can be expected to run faster and use less storage (depending on the data structures used).

TL;DR: The main aim of this paper is to prove above conjecture that ECF f f?(F) for every EOL form F, i.e. that PCF is not an EOL language family, and establish the following considerably stronger result.

TL;DR: The interpolation sequential search algorithm is an algorithm to search ordered tables by interpolating the searched key value with the likmiting values of the table by performing an initial probe in the table.

TL;DR: This paper claims that in the case of non-deterministic constructs (which in [ 1 ] are stressed as being the “normal” case, while determinism is an exception), the quoted claim could be considered as true only in a broad sense of s3ffkiency.

TL;DR: The current work is an improved analysis of the algorithm presented in [2], and a tighter upper bound [3g(m) + n 21 is derived for this search problem.