Showing papers in "Information Sciences in 1969"

TL;DR: An explicit expression for the membership function of the language L(G) generated by a fuzzy grammar G is given, and it is shown that any context-sensitive fuzzy grammar is recursive.

TL;DR: Insight is obtained into this paradox by analyzing a simple Gauss-Markov process and it is shown that there is an optimal choice of h and that the variance increases rapidly when h increases from the optimal value.

TL;DR: It is shown that the stability obtained by the least-squares predictor for a random process is equivalent to uniform asymptotic stability.

TL;DR: The present paper continues Eggan's investigation by showing how to reduce certain regular expressions to regular expressions representing the same set but with smaller star height, and also by showing that certain other regular expressions cannot be so reduced.

TL;DR: Two sequential learning models, A and B, having deterministic and stochastic transition rules, respectively, are formulated based on the strategies of ''many-armed bandit problems,'' and automata using these strategies have shown the desired learning behavior, which is similar to the performance of linear-strategy automata and certain type of Stochastic automata.

TL;DR: The method of the present paper has some points of interest and is believed that the smoothing or interpolation problem (0 A ⩽ T ), which is left open in their paper.

TL;DR: A flexible stochastic experimental procedure based on Chebyshev's inequality is proposed for the λ-stochastic languages and the class of maximum-likelihood Stochastic languages is defined on the basis of the maximum- likelihood final-state distribution.

TL;DR: Theories for constructing filing schemes for formatted files with unequal-valued attributes when the query set contains all queries which specify two values from two attributes are developed.

TL;DR: The results generalize to random processes earlier work of J. B. Thomas and others on the problem of estimating truncation error for deterministic band-limited signals.

TL;DR: The concept of a Uniformly Reflexive Structure (U.R.S.S.) is developed as an abstract approach to computability and an axiomatic characterization of a Godelization is given such that any structure satisfying these axioms is a U.R.'s.

TL;DR: It appears that this complexity criterion does not provide a severe enough penalty for the introduction of additional tapes to a Turing machine.

TL;DR: It turns out, as can be seen from various related results and examples, that the connection between the axiom of choice and effectivity comes up when one considers sentences of the form (∀ x )(∃ y ) χ ( x , y ), where, throughout this abstract, χ is a formula which does not contain quantifiers other than quantifiers restricted to sets.

TL;DR: One can prove, without appealing to the exact separation theorem, that all total recursive functions and all partial recursive functions having at least two integers not in their range are strongly representable in K.

TL;DR: The class of admissible controls is the class of stochastic integrals @K"0^tF(t, s)dv(s), where @n(t) is the innovations process.

TL;DR: Automata theory goes further into the study of constructability by investigating a variety of abstract computing devices which perform these constructions, relating these devices to the algorithms they execute, and characterizing the simplicity of their operation.

TL;DR: The linear sequential equations for estimating the state of a system given noisy measurements are derived for the case in which the system is not randomly perturbed, though some parameters of the system are uncertain.

TL;DR: A technique is described for constructing a state variable to describe an algebraic relation between semi-groups that makes it possible to treat automata and differential equations as special cases of a general mathematical structure.

TL;DR: The concept of a quasi-stroke is defined and developed making use of some of the established methods and results of M-valued logic, with special attention given to those which are dualizable in a manner closely analogous to dual pairs in standard 2-valued Logic.

TL;DR: With this definition of the contaminating error process, the optimal Bayes recognition procedure is developed and the optimal recognition rule is linear in the character observations.

TL;DR: It is shown that the modified formulation for continuous nonlinear minimal-variance filters, while necessary for assured mathematical validity, can be dispensed with in the context of a computational mechanization.

TL;DR: The purpose of this note is to point out that important as this definition of function is, it is incomplete; in order to make it complete, the authors must add, or adjoin, all possible algorithms for the realization of the mapping.

TL;DR: Systems of natural deduction are described in which the usually cumbersome quantifier rules are replaced by somewhat more convenient ones, which have deducibility from a set of assumption formulas as a primitive notion which is shown to have the compactness property.

TL;DR: A three-valued system is used for finding an assignment for a ternary sequential circuit and the realization of a simple machine defined by its flow table illustrates the theory.

TL;DR: A sentence (W) is found such that (Res), the Axiom of Restriction, is equivalent to the conjunction of (F), the axiom of Fundierung, and (W), and furthermore (W).