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

TL;DR: This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel sequencing, related to Ianov's program schema, but extends it, both by modelling memory structure in more detail and by admitting parallel computation.

TL;DR: It is shown that there exists an infinite hierarchy of syntax-directed translations according to the number of nonterminals allowed on the right side of productions of the underlying context-free grammar.

TL;DR: This paper is concerned with the relationship between the correctness of programs and the satisfiability (or unsatisfiability) of certain formulas of the first-order predicate calculus.

TL;DR: The space filling curve is shown to provide a tool for converging to a set of numbers in certain mathematical programming problems where a conventional programming method is not possible and an algorithm for generating such a curve is presented.

TL;DR: In this paper, scattered context grammars are defined and the closure properties of the family of languages generated are considered, which is contained in the context sensitive languages and contains all languages accepted by linear time non-deterministic Turing machines.

TL;DR: The quasi-real-time one- way stack languages are not a full AFL but are a proper subAFL of the one-way stack languages, which properly include the stack languages.

TL;DR: This concept of extremality is shown to be central for a large class of constrained optimization problems and a general set of necessary conditions, which must be satisfied by all solutions of the previously indicated optimization problems are introduced.

TL;DR: The fuzzy sets of input sequences characterized by fuzzy automata constitute a distributive lattice, and the complement of the fuzzy set can be characterized by an optimistic fuzzy automaton.

TL;DR: Translations that can be expressed as generalizations of context free grammars and pushdown automata are defined, and certain necessary conditions that a translation be of that type are given.

TL;DR: This work develops equivalence detecting procedures applicable to programs for which equivalence is undecidable, and considers a sequence of these procedures, each more powerful than the preceding ones, to see if a subsequent more powerful one will return YEs.

TL;DR: It is proved in this paper that every semilinear set is a finite union of disjoint linear sets, using elementary combinatorial-topological lemmas.

TL;DR: This paper introduces a new automaton, called a writing pushdown acceptor (abbreviated wpda), and investigates some of its properties, showing that it is shown that each set accepted by a wPda is accepted by some w pda that halts for all inputs.

TL;DR: This analysis exploits Henrici 's proof to estimate the computational complexity of the solution of the differential equation in terms of its position in the Grzegorczyck hierarchy of primitive recursive functions.

TL;DR: It follows that the family of context-sensitive languages is a principal AFL and an analogous result is proved for deterministic contextsensitive languages.

TL;DR: A decomposition method for nonlinear programming problems with structured linear constraints is described and an algorithm for performing post optimality analysis-ranging and parametric programming-for such structured linear programs is included.

TL;DR: In this article, the concept of imbedding a programming language L into a formal system is introduced and used as the basis of defining the semantics Θ of the language, where Θ is an operator which maps a program p in L onto a function.

TL;DR: It is shown, that for the problems posed in this paper, this maximum principle is an extension of Butkovskii's maximum principle and of Demyanov and Rubinov's theorem.

TL;DR: In contradistinction to Turing's oracle, the device here (which the authors call a referenced automaton) may be regarded as a real-time oracle and seeks to model its construction on the type of computation which relies upon a table look-up, but which, at each next step of computation, may know only the next table entry.

TL;DR: In this work, a convergence criterion is obtained for the nonlinear simultaneous displacements method and a convergence theorem for a stationary modification of non linear simultaneous displacement method is obtained.

TL;DR: The main results of this paper deal with obtaining necessary and sufficient conditions on A in order to ensure the existence of P and P' so that A is equivalent to the canonical matrix with parameters (K, n), where A need not be circulant.

TL;DR: An algorithm is given for a cubature formulae by means of a constructive method for representing a point which is in the conical hull of a given set.

TL;DR: A time-varying linear sequential machine model is considered which hasthe property that the dimensionality of the system is a function of time and it is shown that every TVLSM has a minimal form unique up to isomorphism.

TL;DR: In this paper various algebraic properties of the indefinite Riemann integral that are appropriate for its use on the computer are examined and it is seen that the operation of the integral on certain simply described families of functions indicates how it must also act on more complex families of maps.