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

TL;DR: The recognizable sets of value trees (pseudoterms) are shown to be exactly projections of sets of derivation trees of (extended) context-free grammars.

TL;DR: A variant of the revised simplex method is given for solving linear programs with M+L equations, L of which have the property that each variable has at most one nonzero coefficient in them.

TL;DR: A bracketed grammar is a context-free grammar in which indexed brackets are inserted around the right-hand sides of the rules and bracketed languages are shown to be codes with strong properties.

TL;DR: The cone of positive semi-definite matrices is shown to be invariant under the motions of the Riccati equation and questions of monotonicity and stability are resolved for motions starting in this cone.

TL;DR: It is shown that the Deterministic, nonerasing stack automaton is equivalent to a deterministic, off-line Turing machine whose storage tape never grows beyond n log"2n cells where n is the length of the input.

TL;DR: The problem of determining state from input-output data, for systems with state space of infinite dimension, is considered, and some concrete examples of systems governed by partial differential operators are considered.

TL;DR: A new algebraic approach to the description and understanding of finite-state systems is given in the form of principles derived from the Krohn-Rhodes' prime decomposition theorem for finite semigroups.

TL;DR: The methdos of this algebraic approach are used to obtain a prime decomposition theorem for generalized machines together with the determination of properties preserved under siries and parallel (or cascade) composition of sequential machines.

TL;DR: This paper considers a large class of time-shared systems and solves for the distribution of attained service for any member of this class and expresses the results in terms of the average conditional waiting time.

TL;DR: The problem of approximating such functions (which can be defined, in particular, by probabilistic automata) by nonprobabilism automata is investigated, in several aspects.

TL;DR: The solution of the original problem is reduced to the determination of the absolute maximum of a continuous function of one variable on a bounded interval by means of parametric quadratic programming.

TL;DR: This paper establishes the convergence of the penalty argument on reflexive B-spaces, and then applies it to obtain the Kuhn-Tucker necessary conditions for convex programs in Hillbert space.

TL;DR: This paper investigates homomorphisms on the state behavior of linear machines and characterize their homomorphic images and applies these results to characterize those nonlinear machines which can be realized by larger linear machines.

TL;DR: Both finite-and infinite-dimensional, linear, time-invariant systems are characterized and application to Cauchy problems and distribution semigroups is presented.

TL;DR: A method is described which obtains a ''solution'' to the system which is stable with respect to small changes in the matrix elements and will solve an overdetermined system in m variables and n equations.

TL;DR: For any function f from the set T into the carrier of any monoid M, there exists a unique monoid homornorphism f * : T* -+ M whose underlying function is an extension of the function f.

TL;DR: New results include the derivation of a sufficient condition for the optimal control, existence, and uniqueness theorems for the solution of the associated ''two-point boundary-value problem,'' and an algorithm whose solutions converge to be optimal control.

TL;DR: This model of multitape finite automaton is generalized by allowing the automaton to rewind all its tapes simultaneously at any stage in its computation and is shown to yeild the Boolean closure of the class of word relations defined by multitapes finite automata.

TL;DR: It is proved that the procedure converges in the neighborhood of certain well-behaved stationary points of a functional subject to equality functional constraints.

TL;DR: It is shown that over a reflexive Banach space the class of affine dynamical systems is equivalent to theclass of linear differential systems.

TL;DR: If A is a completely continuous self-adjoint operator on a Hilbert space its eigenvalues are the values of the inner product at stationary points on the unit sphere provided that certain regularity conditions hold at the eigenvectors.

TL;DR: The decomposition method can be applied to problems which contain coupling constraints or coupling variables occurring in the objective function to solve large structured quadratic maximization problems.

TL;DR: In this paper, necessary conditions for a generalized solution to be optimal were derived and the method of proof was posed somewhat differently than in [1] for optimal control problems, the two can easily be shown to be equivalent.

TL;DR: The analogy of the Krohn-Rhodes theory of finite state machines is developed for linear positive machines with inputs from a commutative Banach algebra with involution, and every positive machine is shown to lie in the closed convex hull of its primes.