12th Annual Symposium on Switching and Automata Theory (swat 1971)

13-15 Oct. 1971

Filter Results

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

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

    Publication Year: 1971, Page(s):iv - v
    Request permission for commercial reuse | PDF file iconPDF (126 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 1971, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (41 KB)
    Freely Available from IEEE
  • High level languages of maximum power

    Publication Year: 1971, Page(s):1 - 4
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (489 KB)

    The high level languages here are simplified programming languages focussing attention on various facilities such as recursion and pushdown stores. They are assumed to have some kind of subroutine facility. The notion of power studied is obtained by treating the programs as presenting functions of variable sub-routines and arguments of arbitrary data type. Languages are exhibited which are capable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On classes of program schemata

    Publication Year: 1971, Page(s):5 - 19
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1595 KB)

    We define the following classes of program schemata: P = class of schemes using a finite number of simple variables PA = class of schemes using simple and subscripted variables (arrays) PR = class of schemes allowing recursive functions PL = class of schemes allowing labels as values Pm = class of schemes allowing a finite number of special markers as values Ppds = class of schemes using pushdown ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the composition of parallel program schemata

    Publication Year: 1971, Page(s):20 - 23
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (613 KB)

    Theoretical properties of computer programs have been the object of considerable study in recent years. In this paper we consider the problem of joining - or composing - one program with another. We study basic properties of compositions within a theoretical model for parallel computation which is closely related to parallel program schemata. In particular, we introduce the notion of finishing sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward a weakly invariant complexity theory

    Publication Year: 1971, Page(s):24 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1227 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.
  • Effective computation over the real numbers

    Publication Year: 1971, Page(s):33 - 37
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (631 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.
  • On the design of easily testable sequential machines

    Publication Year: 1971, Page(s):38 - 42
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    In order to obtain a short fault-detection sequence for a sequential machine, the concept of an easily testable machine is introduced. Such a machine is one which possesses a minimal-length homogeneous distinguishing sequence and requires no transfer sequences in the fault-detection sequence. A design procedure is presented in which an arbitrary machine is embedded in an easily testable machine by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal base functions and modules for realizing arbitrary switching functions

    Publication Year: 1971, Page(s):43 - 59
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1606 KB)

    Universal base functions (UBF's) are defined which are generalizations of universal logic functions. An (n, m, r)-UBF can be implemented as a single module (UBM) with n+m inputs and 1 output. An arbitrary n-variable switching function fn (X) is then realized on the fixed UBM by realizing a suitable set of m r-variable functions with which to drive m inputs of the UBM, the remaining n inputs being ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of asynchronous sequential circuits with master-slave subcircuits

    Publication Year: 1971, Page(s):60 - 78
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1281 KB)

    This paper presents a synthesis method to realize any p-state normal asynchronous sequential circuit A according to an unconventional structure. It consists of two critical-race free S.T.T. normal asynchronous circuits A1 and A2 connected in series, where A1 is realized with L internal variables and A2 with 2 · So internal variables (So = [ log2 p] ). It is shown that L = 1 for circuit A w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rectangular logic array

    Publication Year: 1971, Page(s):79 - 90
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1181 KB)

    A rectangular logic array is described which can realize any combinational switching function. Straight-forward analysis and synthesis procedures are described and the realizations of a number of special functions are given. These include threshold functions, parity functions, symmetric functions, and universal logic functions. Other properties of the array which are examined include diagnostic pr... View full abstract»

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

    Publication Year: 1971, Page(s):91 - 104
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1088 KB)

    This paper investigates the properties and utilizations of one- and two-dimensional NAND gate cellular arrays. Both irredundant and redundant one-dimensional cascades are investigated. The cascade's output function is obtained in closed form, and a test and synthesis procedure is developed. Both irredundant and redundant two-dimensional arrays are examined, and an arbitrary two-dimensional array i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation by multi-head finite automata

    Publication Year: 1971, Page(s):105 - 113
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1035 KB)

    Families of languages recognized by multi-head writing finite automata are considered. For n≥1, an n-head writing finite automaton (n-wfa) is a finite state device with n one-way read-write heads on a single input tape. Relationships between families of languages recognized by n-wfa (Wn) and other models (e.g. n-head nonwriting finite automata, linear-bounded automata, and real-time buffer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Depth-first search and linear graph algorithms

    Publication Year: 1971, Page(s):114 - 121
    Cited by:  Papers (37)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1070 KB)

    The value of depth-first search or "backtracking" as a technique for solving graph problems is illustrated by two examples. An algorithm for finding the biconnected components of an undirected graph and an improved version of an algorithm for finding the strongly connected components of a directed graph are presented. The space and time requirements of both algorithms are bounded by k1V + k2E + k3... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A n5/2 algorithm for maximum matchings in bipartite

    Publication Year: 1971, Page(s):122 - 125
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (397 KB)

    The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m+n) n. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On decreasing the computing time for modular arithmetic

    Publication Year: 1971, Page(s):126 - 128
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (393 KB)

    In this paper it is shown that by suitably modifying Garner's algorithm for applying the Chinese Remainder Theorem to optimally employ the fast multiplication techniques of Schönhage and Strassen, one can often decrease the computing time of algebraic algorithms employing modular (congruence, residue) arithmetic. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boolean matrix multiplication and transitive closure

    Publication Year: 1971, Page(s):129 - 131
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB)

    Arithmetic operations on matrices are applied to the problem of finding the transitive closure of a Boolean matrix. The best transitive closure algorithm known, due to Munro, is based on the matrix multiplication method of Strassen. We show that his method requires at most O(nα · P(n)) bitwise operations, where α = log27 and P(n) bounds the number of bi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal algorithms for parallel polynomial evaluation

    Publication Year: 1971, Page(s):132 - 139
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 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.
  • Bounds on the evaluation time for rational polynomial

    Publication Year: 1971, Page(s):140 - 143
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (407 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.
  • Two-dimensional formal languages and pattern recognition by cellular automata

    Publication Year: 1971, Page(s):144 - 152
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1289 KB)

    A formal study of pattern recognition capabilities of cellular automata is undertaken based on a class of recently introduced grammars for two dimensions, the array grammars, which can be thought of as the two-dimensional generalization of context-sensitive grammars. The class of languages (patterns) generated by array grammars is shown to be precisely the class of languages accepted by cellular a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LR-regular grammars An extension of LR(k) grammars

    Publication Year: 1971, Page(s):153 - 165
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1887 KB)

    LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception. Arbitrarily long look-ahead is allowed before making a parsing decision during the bottom-up syntactical analysis; however, this look-ahead is restricted in that the essential "lookahead information" can be represented by a finite number of regular sets, thus can be computed by a finite state machine... View full abstract»

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

    Publication Year: 1971, Page(s):166 - 176
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1229 KB)

    Let Σ be a finite alphabet, Σ* the free monoid generated by Σ and |x| the length of x ε Σ*. For any integer k ≥ 0, fk(x)(tk (x)) is x if |x| ≪ k+1, and it is the prefix (suffix) of x of length k, otherwise. Also let mk+1 (x) = {v|x = uvw and |v| = k+1}. For x,y ε Σ* define x ∼k+1y iff fk(x) = fk(y), tk(x) = tk(y) and mk+1(x) =... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priority paging algorithms and the extension problem

    Publication Year: 1971, Page(s):177 - 181
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (706 KB)

    Given a particular computer system the extension problem concerns the prediction of performance when the size of main memory is increased. In this paper a specific approach to this problem is formulated for demand paging systems. A necessary and sufficient condition on the nature of page replacement rules which leads to solutions of the extension problem is a major result of the paper. As the othe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time bounds on space computations

    Publication Year: 1971, Page(s):182 - 187
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (706 KB)

    A physico-mathematical basis is used to establish bounds TD(n) on the time needed to compute n-argument functions by spatially distributed primitive devices or composite systems D. The axioms used concern the speed, packing density and noise threshold of the energy with which any computing device detects or alters the physical representation of information. The principal result is that TD(n) grows... View full abstract»

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