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

TL;DR: The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm-PICK.

TL;DR: It is proved that a T(n) time-bounded Turing machine can be simulated by an O(T(n).l( t(n), l(n))) timebounded RAM, and that a L( n), a fixed program, can be simulate by a Turing machine whose execution time is bounded by (T( n))^3 if l( n) is constant, or (T (n) is logarithmic.

TL;DR: A variant of the Kolmogorov concept of complexity which yields a common theory of finite and infinite random sequences and some concepts of effective tests which are proved to be equivalent are established.

TL;DR: This paper proves the following theorem: For any real numbers r"1, r"2, [email protected]?r"1 , where r is the number of real numbers and 𝕂 is the inequality between real numbers.

TL;DR: It is shown that the quasirational recursion schemes are translatable into strongly equivalent program schemes, and there is a monadic recursion scheme not strongly equivalent to any program scheme with one counter.

TL;DR: It is shown that deterministic two-way finite automata with n+2 heads are strictly more powerful than deterministicTwo- way finite automATA with n heads for each positive integer n.

TL;DR: The family of LR-regular languages is studied; it properly includes the family of deterministic CF languages and has similar properties.

TL;DR: A characterization theorem involving pushdown automata is proved, and it follows that the strict Deterministic languages are coextensive with the family of prefix free deterministic languages.

TL;DR: A decision procedure is described for equivalence of deterministic two-tape (one-way) automata with respect to deterministic one-way automata.

TL;DR: It is shown that, provided the degree of the polynomial to be evaluated exceeds k[log"2k], an algorithm given is within one time unit of optimality.

TL;DR: An algorithm for determining whether two triconnected planar graphs are isomorphic is presented and the asymptotic growth rate of the algorithm is bounded by a constant times log where |V| is the number of vertices in the graphs.

TL;DR: A new device called a maze recognizing automaton is introduced that accepts precisely the threadable mazes and can be simulated by a deterministic L(n)-tape bounded Turing machine, provided L( n)>=log"2n".

TL;DR: New characterizations for the flowchartability of recursive functionals show that a representative is flowchartable if, and only if, it is simple or linear, and that, when the context is restricted so that only invertible operations are considered, such aRepresentation is flow chartable if-and-only if it is nested.

TL;DR: Two pumping lemmas are proved (Theorems 3 and 4) which yield corollaries such as: o~ is the closer of under union, product, and star operation and the rational cone W generated by D~* can be characterized by the structure of the pushdown automata recognizing the languages in cg.

TL;DR: It is shown that context-sensitive web grammar cannot erase arcs, and monotone context- sensitive web grammar can erase arcs but cannot erase any vertices, and there exists a complete grammar which generates some types of Eulerian graphs, line graphs and 3-connected graphs.

TL;DR: A configuration is said to be with finite support if the states of all but fintely many cells in the array are quiescent and it is recursively unsolvable when d>=2, for a configuration c with finiteSupport in a d-dimensional cellular automaton.

TL;DR: It is shown here that the equivalence problem for nondeterministic e-free generalized machines can be reduced to the equality problem of the sentential forms of a particular type of linear context-free grammars with a center-marker.

TL;DR: A number of algorithms are given which can be considered to produce, from a finite number of observations of the development of a particular kind of organism, a model which represents the developmental rules of that organism.

TL;DR: A characterization of the family of n-parallel right linear languages by nondeterministic generalized sequential machines with accepting states is proved.

TL;DR: A loop transmission system consisting of a central station, N input terminals with infinite buffer, and a multiplexed channel is considered, and the distributions of the queue lengths at all terminals and of the virtual waiting times of data units are calculated.

TL;DR: A characterization theorem for the three classes of automata, a condition for direct product decomposability of a strongly connected permutation automaton, and some other related results are proposed in this paper.

TL;DR: An error bound for a quasilinear elliptic boundary value problem (including the case of nonlinear differential boundary conditions) is obtained as a positively weighted sum of the absolute defects of the operator equations.

TL;DR: It is shown that each of the above conditions, in conjunction with a third condition, permits every language in the AFL defined by to have a representation in the form , where R is a regular set and h"1 and h'2 are homomorphisms, with h"2 nondecreasing.

TL;DR: The proposed assignment made for input-free sequential logical networks has the following features: the i-th logical network (i=1,...n) does not contain any invertors.

TL;DR: From this group theoretic characterization of linear permutation automata, a complete characterization of all homomorphisms of a linear automaton which yield linearly realizable image automata is derived as well as several results about the structure of linear automata.

TL;DR: A structure theorem for monoids of linear systems reveals the R monoid of Give'on and Zalcstein as appropriate only when no distinct powers of the statetransition matrix have the same action.

TL;DR: It is proved that the least upper bound, L, on the length of synchronizing sequences is bounded by where n is the number of states and @m = n(n - 1)/2.

TL;DR: It is concluded that allowing nonlinear output decoding with infinite state linear machines leads to a triviality (as opposed to the case of finite statelinear machines where it does not).

TL;DR: The multiplicative efficiency measure E is defined to be (log 2 p )/ M, where p is the order of convergence and M is the number of multiplications or divisions needed to compute.

TL;DR: Extensive empirical studies of all three methods show that this new algorithm will be superior for polynomials of even relatively small degree, thus guaranteeing a practical as well as a useful result.