7th Annual Symposium on Switching and Automata Theory (swat 1966)

26-28 Oct. 1966

Filter Results

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

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

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

    Publication Year: 1966, Page(s): 3
    Request permission for commercial reuse | PDF file iconPDF (57 KB)
    Freely Available from IEEE
  • Context-free language processing in time n3

    Publication Year: 1966, Page(s):7 - 20
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1623 KB)

    Three problems in language processing are the recognition of strings that are sentences of a given language, the parsing of sentences according to a given grammar, and the syntax-directed translation of sentences in one language to those in another. Limiting our attention to context-free languages, we consider first the simplest of these problems--recognition. A procedure is given whereby for an a... View full abstract»

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

    Publication Year: 1966, Page(s):21 - 35
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1663 KB)

    A transduction is a mapping from one set of sequences to another. A syntax directed transduction is a particular type of transduction which is defined on the grammar of a context free language and which is meant to be a model of part of the translation process used in many compilers. The transduction is considered from an automata theory viewpoint as specifying the input-output relation of a machi... View full abstract»

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

    Publication Year: 1966, Page(s):36 - 46
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1347 KB)

    The s-languages are those languages recognized by a particular restricted form of deterministic pushdown automaton, called an s-machine. They are uniquely characterized by that subset of the standard-form grammars in which each rule has the form Z → aY1...Yn, n≥0, and for which the pairs (Z, a) are distinct among the rules. It is shown that the s-languages have the prefix property,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One-way stack automata Extended abstract

    Publication Year: 1966, Page(s):47 - 52
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (667 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.
  • Real-time computation by n-dimensional iterative arrays of finite-state machines

    Publication Year: 1966, Page(s):53 - 77
    Cited by:  Papers (2)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2529 KB)

    An n-dimensional iterative array of finitestate machines (abbreviated nD) is a special type of real-time tape acceptor. The principal results are as follows: 1. nD's have equivalent forms With simplified stencils and length k encodings of the input alphabet. 2. The set of palindromes and the set of tapes of the form ττ are accepted by 1D's. 3. The sets of tapes accepted by nD's are a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The recognition problem for the set of perfect squares

    Publication Year: 1966, Page(s):78 - 87
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1245 KB)

    Lower bounds on the capacity and on the product of capacity and computation time are obtained for machines which recognize the set of squares. The bound on capacity is approached to within a factor of four by a specific machine which carries out a test based on the fact that every non-square is a quadratic non-residue of some rational prime. A machine which carries out a test based on the standard... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Roots of star events

    Publication Year: 1966, Page(s):88 - 95
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (870 KB)

    A regular event W is a star event iff there exists another event V such that W = V*. In that case, V is called a root of W. It is shown that every regular event has a unique minimum root, which is contained in every other root of W. An algorithm for finding the minimum root is presented, and the root is shown to be regular. The results have applications to languages, codes, canonical forms for reg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subdirect decompositions of transformation graphs

    Publication Year: 1966, Page(s):96 - 102
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (761 KB)

    A transformation graph is a finite directed graph with exactly one edge issuing from each vertex. A graph is subdirectly decomposed into two factor graphs, if it is isomorphic to a subgraph of their direct (Cartesian) product. The decomposition is A-optimal, if the maximal order (i.e., number of vertices) of the factor graphs is minimal. It is B-optimal, if the sum of the orders is minimal. This p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pair algebra and its application

    Publication Year: 1966, Page(s):103 - 112
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (786 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.
  • Generalized decomposition of incomplete finite automata

    Publication Year: 1966, Page(s):113 - 126
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1571 KB)

    The problem of decomposing a finite automaton has been investigated by many authors [7,8,9,16]. However, their results were based on the question of decomposing an automaton into series and parallel connections of automata. The present work is an extension to the problem of generalized decomposition where two-way interconnections between automata are permitted. Our decomposition does not presuppos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graphs of affine transformations, with applications to sequential circuits

    Publication Year: 1966, Page(s):127 - 135
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 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.
  • A method for the combined row-column reduction of flow tables

    Publication Year: 1966, Page(s):136 - 147
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (935 KB)

    A systematic method for the combined row-column reduction of incompletely specified flow tables is presented. A generalized cover of a flow table is defined in terms of compatibility classes of rows and columns. The problem of finding a minimal generalized cover is solved by an integer-restricted linear program, or, equivalently, by a tabular method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Standard minimum transition time secondary assignments for asynchronous circuits

    Publication Year: 1966, Page(s):148 - 153
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (554 KB)

    Two general types of standard minimum transition time secondary assignments for arbitrary r-row flow tables are derived. One class requires 1/2 no(no + 1) secondary variables, no = [log2 r], and the second, a comparable number but less than 1/2 no(no + 1). These standard assignments thus provide a significantly better lower bound for any flow table than other standard assignments which require 2no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A row assignment for delay-free realizations of flow tables without essential hazards

    Publication Year: 1966, Page(s):154 - 159
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (826 KB)

    A method is presented for realizing any flow table that does not contain essential hazards with a circuit requiring no delay elements for proper operation. The procedure generally requires considerably fewer state-variables than did an earlier technique for achieving the same result. It is based on a modification of a method by Tracey for constructing single-transition-time row assignments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of multiple sequential machines

    Publication Year: 1966, Page(s):160 - 171
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1122 KB)

    Some further results on the synthesis of two or more sequential machines which are fed from the same input signal source are presented. It is shown that a minimal-state machine realization can always be obtained in a completely systematic way, such that the state-variable and output variable dependencies are reduced simultaneously. For two specified reduced machines, M1 and M2, with specified init... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization of sequential machined with threshold elements

    Publication Year: 1966, Page(s):172 - 183
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1453 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.
  • The application of threshold logic to the design of sequential machines

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

    The application of threshold logic to the design of sequential machines is the subject of this paper. A single layer of threshold logic units in the combinational portion of a sequential machine is used as the general model to be studied, and investigations have been made in the areas of autonomous machines, counters, sequence generators, and general input-output machines. This model was chosen fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization and convexity in threshold logic

    Publication Year: 1966, Page(s):195 - 200
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    The problem of deciding whether or not an arbitrary N-variable switching function is realizable with a single threshold element device is known to be convertible to the global minimization of a functional derivable from the given switching function. This functional is shown to consist of a structure of intersecting hyperplanes each of which is related to some threshold function. It is further show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On minimal modulo 2 sums of products for switching functions

    Publication Year: 1966, Page(s):201 - 206
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB)

    The minimal number of terms required for representing any switching function as a modulo-2 sums of products is investigated, and algorithm for obtaining economical realizations is described. The main result is the following: Every symmetric function of 2m+1 variables has a modulo-2 sum of products realization with at most 3m terms, but there are functions of n variables which require at least 2n/n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conjunctive encoding of Boolean matrices

    Publication Year: 1966, Page(s):207 - 214
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    A procedure is presented for encoding the states of a control counter in such a way as to make each output or its complement decodable as a single AND-gate, where the inputs to the AND-gates are state variables or their complements. It is assumed that the number of state variables used is a design choice. In fact, it may well be advantageous to assign more than the minimum required number of varia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous propagation-limited logic

    Publication Year: 1966, Page(s):215 - 226
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1518 KB)

    It is generally recognized that asynchronous operation of logic networks offers specific advantages over synchronous operation controlled by a central clock when the network is subject to large or widely varying inter-module propagation delays. In this paper we characterize several previously described techniques for achieving asynchronous operation by a single model. Essential to the model is the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The synthesis of multipurpose logic devices

    Publication Year: 1966, Page(s):227 - 235
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (679 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.