By Topic

10th Annual Symposium on Switching and Automata Theory (swat 1969)

15-17 Oct. 1969

Filter Results

Displaying Results 1 - 25 of 29
  • [Front cover]

    Publication Year: 1969
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1969, Page(s):4 - 5
    Request permission for commercial reuse | PDF file iconPDF (100 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 1969, Page(s): 3
    Request permission for commercial reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • Dense and non-dense families of complexity classes

    Publication Year: 1969, Page(s):7 - 19
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1147 KB)

    Let Φ be any abstract measure of computational complexity, and let L denote the specific measure of memory resource (tape) on one tape Turing machines. Denote by Rt( )Φ the class of all total functions whose Φ-complexity is bounded by the function t( ) almost everywhere. Call such classes Φ-complexity classes. We are interested in relationships among these classes, unde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The operator gap

    Publication Year: 1969, Page(s):20 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (690 KB)

    This paper continues investigations pertaining to recursive bounds on computing resources (such as time or memory) and the amount by which these bounds must be increased if new computations are to occur within the new bound. The paper proves that no recursive operator can increase every recursive bound enough to reach new computations. In other words, given any general recursive operator F[ ], the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative procedures

    Publication Year: 1969, Page(s):27 - 35
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    Iterative procedures have many advantages for computation, for instance an approximation to the final answer is provided even if the computation stops abruptly. A model for iterative computation is proposed where a procedure G executed repeatedly "converges" to a function f. A notion of approximation of functions on the integers is used based on limits of densities. Some results on the power of it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some techniques for proving certain simple programs optimal

    Publication Year: 1969, Page(s):36 - 45
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1079 KB)

    This paper develops techniques for establishing a lower bound on the number of arithmetic operations necessary for sets of simple expressions. The techniques are applied to matrix multiplication. A modification of Strassen's algorithm is developed for multiplying n × p matrices by p × q matrices. The techniques are used to prove that this algorithm minimizes the number of multiplicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Storage interference in asynchronous computations

    Publication Year: 1969, Page(s):46 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1250 KB)

    Some properties of multiprocessing systems, i.e. computing systems in which a set of computational elements share a pool of storage elements are investigated. In particular, the conditions for the output-functionality of these systems are studied, where a computing systems is defined as being output-functional when it produces the same sequence of outputs for the same program, initial state, and i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous control networks

    Publication Year: 1969, Page(s):61 - 73
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1206 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic representation of formal languages

    Publication Year: 1969, Page(s):74 - 81
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (839 KB)

    The problem of assigning a probability to each string of a language L(G) generated by a grammar G is considered. Two methods are considered. One method assigns a probability to each production associated with G and the other assigns the probabilities on the basis of particular features of the language. Several necessary conditions that must be satisfied by these probability assignment techniques i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The incompletely-specified finite-state stochastic machine sequential equivalence and reduction

    Publication Year: 1969, Page(s):82 - 89
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1037 KB)

    The stochastic sequential machine is invariably treated as the stochastic extension of the completely-specified deterministic machine. This paper investigates the incompletely-specified finite-state stochastic sequential machine from the viewpoint of machine equivalence and reduction. Definitions are chosen and procedures developed so that they reduce to the conventional froms in the special cases... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On probabilistic automata with structural restrictions

    Publication Year: 1969, Page(s):90 - 99
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (994 KB)

    Results on two distinct aspects of the theory of probabilistic automata (PA) are presented. Part I is devoted to two generalizations of the theory of loop-free decomposition of stochastic finite-state systems formulated by G. Bacon. The first generalization consists of making a modification in the decomposition scheme of Bacon to allow for the decomposition of a larger class of systems. The second... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Definite stochastic sequential machines and definite stochastic matrices

    Publication Year: 1969, Page(s):100 - 105
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (621 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single pass precedence analysis

    Publication Year: 1969, Page(s):106 - 117
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1071 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Table machine simulation

    Publication Year: 1969, Page(s):118 - 128
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1291 KB)

    A pushdown table machine can be simulated by a computer in time n log log n where n is the number of table machine operations. A finite state table machine can be simulated in linear time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognition of context-free and stack languages

    Publication Year: 1969, Page(s):129 - 132
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (519 KB)

    This paper is concerned with the recognition of Context-free and deterministic 1-way stack (sa) languages, using n-dimensional Iterative Finitestate Automata (n-D IFA). A problem posed by Cole3 is also answered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic context-sensitive languages

    Publication Year: 1969, Page(s):133 - 148
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1933 KB)

    A context-sensitive grammar G is said to be CS(k) iff a particular kind of table-driven parser, Jk(G), exists. Corresponding to each Jk(G), we define a class of parsers Jk(G). Jk(G) is itself a Jk(G). The main results are: 1. Any processor Jk(G) for a CS(k) grammar G accepts exactly the sentences of G. 2. The set of languages generable by CS(k) grammars is exactly the set of languages accepted by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two characterizations of the context-sensitive languages

    Publication Year: 1969, Page(s):149 - 156
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (733 KB)

    An n-dimensional bug-automation is generalization of a finite state acceptor to n-dimensions. With each bug B, we associate the language L(B) which is the set of top rows of the n-dimensional rectangular arrays accepted by B. One-dimensional bugs define trivially the regular sets. Twodimensional bugs define precisely the context-sensitive languages, while bugs of dimension 3 or greater define all ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the representation of formal languages using automata on networks

    Publication Year: 1969, Page(s):157 - 165
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1158 KB)

    A new model of abstract automata is presented employing the concept of finite automata on a network. Each normal network n provided with a one-way input tape determines a family of languages nl. A representation theorem, analogous to the Chomsky-Schützenberger representation theorem for context free languages1, is proved for the class nl. One consequence is that nl is a principal full AFL ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault diagnosis of logical circuits

    Publication Year: 1969, Page(s):166 - 173
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (769 KB)

    Some new techniques for finding minimal set of tests which detect faults in combinational logic networks are described. A systematic procedure which can be programmed on a digital computer is given. Moreover, a new approach to the design of fault detection experiments for sequential machines which takes into account the actual construction of the sequential network is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Machine identification concepts of path sensitizing fault diagnosis

    Publication Year: 1969, Page(s):174 - 181
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1085 KB)

    The automata roots of path sensitizing fault diagnosis are discussed. It is demonstrated that the path sensitizing diagnosis method is equivalent to a Moore type "machine identification" experiment for a machine class which contains good and faulty copies of a transmission path submachine of a complete machine. The maximum length of a complete set of path sensitizing tests for a machine is propora... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Threshold logic: A simplified synthesis by a recursive method

    Publication Year: 1969, Page(s):182 - 193
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (846 KB)

    Despite the numerous threshold logic synthesis methods developed in the past decade, the logic designer is still handicapped by the technological independent characterization of these methods. Hence, it has long been the desire for the logic designer to have a simple, efficient threshold-logic synthesis method, analogous to conventional Boolean synthesis using ANDs, ORs, or combinations of ANDs an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iteratively realized sequential circuits: Further considerations

    Publication Year: 1969, Page(s):194 - 212
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1670 KB)

    Previous papers have shown that for any given n-input synchronous sequential machine there exists a circuit realization in which the circuit consists of a finite number of identical copies of one module and in which the modules are interconnected in a uniform manner. This paper shows that additionally the signal fan-in to every module and the signal fan-out from every module and from the input can... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the modular decomposition of autonomous sequential machines

    Publication Year: 1969, Page(s):213 - 221
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (877 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full AFLS and nested iterated substitution

    Publication Year: 1969, Page(s):222 - 230
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1335 KB)

    A superAFL is a family of languages closed under union with unitary sets, intersection with regular sets, and nested iterated substitution and containing at least one nonunitary set. Every superAFL is a full AFL containing all context-free languages. If L is a full principal AFL, then S∞(L, the least superAFL containing L, is full principal. If L is not substitution closed, the substitutio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.