Showing papers in "Journal of Computer and System Sciences in 1974"

TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.

TL;DR: Low-order polynomial time algorithms for near-optimal solutions to the problem of bin packing are studied and linear-time approximations to these packing rules whose worst case behavior is as good as that of FIRST FIT under a large variety of restrictions on the input are presented.

TL;DR: Several representations of the recursively enumerable (r.e.) sets are presented and it is shown that this automata theoretic representation cannot be strengthened by restricting the acceptors to be deterministic multitape, nondeterministic one-tape, or nondetergetic multicounter acceptors.

TL;DR: Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parallel battery of finite automata, a simple and transparent development of McNaughton's theory of automata on @w-tapes is given.

TL;DR: There are two main results proved here that state that a certain set SP of strings (those coding ''solvable path systems'') has tape complexity (log n)^2 iff every set in (i.e., of deterministic polynomial time complexity) has Tape complexity ( log n,^2).

TL;DR: An algorithm for testing whether a flow graph is reducible is described, which uses depth-first search to reveal the structure of the flow graph and a good method for computing disjoint set unions to determine reducibility from the search information.

TL;DR: This paper describes an implementation of recursion which is both correct and optimal in a general class of sequential languages, and therefore constitutes an attractive alternative to both “ call-by-name” and “call- by-value”.

TL;DR: It is shown that an arbitrary program P is reducible to a D-chart if and only if P does not contain a loop with two distinct exits.

TL;DR: It is shown that if division and multiplication in a Euclideandomain can be performed in O(N log^aN) steps, then the residues of an N precision element in the domain can be computed in O (N log-log-log N) steps.

TL;DR: It is shown that the derivation trees of a context free set are always characterized by some recognizable set over a related many-sorted alphabet.

TL;DR: This paper proves the existence of a hierarchy of languages which is properly contained in the context sensitive languages and which starts with the context-free family, defined inductively by controlling labeled linear grammars with languages in one family to yield languages in the next larger family.

TL;DR: The results do not establish the existence of possible relationships between these classes; rather, they show the consequences of such relationships, in some cases offering circumstantial evidence that these relationships do not hold and that certain pairs of classes are set-theoretically incomparable.

TL;DR: This paper study properties of mefa's and formulate a necessary and sufficient condition for regular sets to be mefa-recognizable and develop algorithms for testing for this condition and for constructing the recognizing mefa whenever this conditions is satisfied.

TL;DR: A general method for converting any off-line multiplication algorithm which forms the product of two n-digit binary numbers in time F( n) into an on-line method which uses time only O(F(n) log n), assuming that F is monotone and satisfies n@?F (n) @?F(2n)/2@?kF(N) for some constant k.

TL;DR: The resulting ''p-adic stability theory'' is used to solve the realization problem for matrix sequences over a broad class of integral domains, generalizing results first announced in Rouchaleau, Wyman, and Kalman.

TL;DR: This paper examines the minimal-program complexity (i.e., the length of a shortest program for computing the initial segments) of recursively enumerable and @D"2 sequences and determines bounds on the upper and lower extent of these sequences within the complexity hierarchy.

TL;DR: This work notes several results indicating that the degrees of recursive approximability of halting sets in arbitrary Godel numberings have wide variation, while restriction to ''optimal Godels numberings'' only narrows the possibilities slightly.

TL;DR: This paper gives a necessary and sufficient condition for translatability of flowcharts into while programs.

TL;DR: The family of vector languages properly contains all context-free languages and the Parikh mapping of a vector language is shown to be semilinear.

TL;DR: The main results specify restrictions on interpretations that will allow the translatability of a class into a class, not being translatable into over all (or unrestricted) interpretations.

TL;DR: A deterministic sequential device that receives one input symbol at a time, prints output symbols from left to right on an output tape, and halts for some input sequences is used to compute some representation of the value of a function.

TL;DR: It is shown that the least-squares solutions of the operator equation Ax=b are C-stationary points for the functional (1/2)@[email protected]?^2 when R(A) is closed.

TL;DR: Left-derivation bounded languages are defined as those languages defined from context-free grammars by placing a bound on the number of nonterminals appearing in left-derivations.

TL;DR: It is shown that any finite state pattern can evolve from the starting pattern in the case where the neighborhood scope is three or more and the cell in the array has 2^i3^j states.

TL;DR: Two types of representation theorems and properties of sets of optimal policies are investigated in detail for r-sdp and r-msdp, and a subclass of r-MSdp, r-imsdp, is introduced in the last half of this paper.

TL;DR: It is shown that each language accepted by a stack-counter acceptor is accepted byA stack- counter acceptor operating in quasi-realtime.

TL;DR: The main results characterize those full AFLs having a largest full incomparable AFL and relate properties of @? to properties of #AFL, and if there is a maximal AFL containing @?' incomparable with @?.