15th Annual Symposium on Switching and Automata Theory (swat 1974)

14-16 Oct. 1974

Filter Results

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

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

    Publication Year: 1974, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 1974, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (61 KB)
    Freely Available from IEEE
  • A two-dimensional generating system modeling growth by binary cell division

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

    We first introduce informally our grammatical scheme for modeling the generation or growth of data structures which can be viewed as the neighbor relations (topologically invariant) for planar maps, permitting binary division of "countries" or "cells", motivated by biological considerations and by the desire to generate successive patterns in the Lindenmayer fashion (i.e., by simultaneous applicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the power of multiplication in random access machines

    Publication Year: 1974, Page(s):13 - 23
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB)

    We consider random access machines with a multiplication operation, having the added capability of computing logical operations on register are considered both as an integer and as a vector of bits and both arithmetic and boolean operations may be used on the same register. We prove that, counting one operation as a unit of time and considering the machines as acceptors, deterministic and nondeter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The equivalence problem for regular expressions over one letter is elementary

    Publication Year: 1974, Page(s):24 - 27
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (207 KB)

    This paper proves a conjecture of Meyer and Stockmeyer, that the equivalence problem of regular expressions over one letter alphabets, with the operations of union, concatenation, Kleene star, negation and squaring, is solvable in elementary time and space. This is done by reduction of this problem to Presburger Arithmetic, making use of an algorithm presented by Oppen. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P-complete problems and approximate solutions

    Publication Year: 1974, Page(s):28 - 32
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    We study the class of P-Complete problems and show the following: i) for any constant ε ≫0 there is a P-complete problem for which an ε-approximate solution can be found in linear time ii) there exist P-Complete problems for which linear time approximate solutions that get closer and closer to the optimal (with increasing problem size) can be found iii) there exist P-Complete problems for which th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate algorithms for the traveling salesperson problem

    Publication Year: 1974, Page(s):33 - 42
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (266 KB)

    Several polynomial time algorithms finding "good," but not necessarily optimal, tours for the traveling salesman problem are considered. For the nearest neighbor method, the worst case ratio of the obtained tour to the optimal tour is shown to increase logarithmically with the number of cities. For another method, which we call the nearest insertion method, the worst case ratio is shown to approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relationships between monadic recursion schemes and deterministic context-free languages

    Publication Year: 1974, Page(s):43 - 51
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (450 KB)

    The equivalence problem for languages accepted by deterministic pushdown automata is shown to be decidable if and only if the strong equivalence problem for monadic recursion schemes is decidable. The proof is obtained through a series of reductions, and several different classes of acceptors are introduced. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive schemes, algebraic trees and deterministic languages

    Publication Year: 1974, Page(s):52 - 62
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    The equivalence problems for uninterpreted recursive program schemes and deterministic pushdown automata are reducible to each other. The equivalence class of a scheme is characterized by an infinite tree which is generated by the scheme as a language by a context-free grammar and which satisfies the equations of the system. Such trees are called algebraic. Roughly speaking, a tree is algebraic if... View full abstract»

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

    Publication Year: 1974, Page(s):63 - 77
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (598 KB)

    Many apparently divergent approaches to specifying formal semantics for programming languages are applications of initial algebra semantics. Here we provide an overview of the concept of initial algebra semantics. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Axiomatic equivalence of programs with structured variables

    Publication Year: 1974, Page(s):78 - 83
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    A program schema which models straight line code admitting structured variables such as arrays, lists, queues etc. is considered. A set of expressions is associated with a program reflecting the inputoutput transformations. Given a set of basic axioms defining expression equivalence the class of programs with equivalent expression sets is characterized by a minimal complete set of equivalence pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ianov schemas augmented by a pushdown memory

    Publication Year: 1974, Page(s):84 - 94
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (538 KB)

    An IP-schema (Ianov schema with pushdown memory) has one register just as for Ianov schemas, but the finite-state control is augmented by a pushdown memory that can only be used for storing the contents of the register or fetching the contents of the top to the register. An IP(k)-schema is an IP-schema which uses only the first k memory locations of the pushdown memory. Let CIP(k)(or CIP) be the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On hash-coding algorithms for partial-match retrieval

    Publication Year: 1974, Page(s):95 - 103
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (267 KB)

    We examine the efficiency of generalized hash-coding algorithms for performing partial-match searches of a random-access file of binary words. A precise characterization is given of those hash functions which minimize the average number of buckets examined for a search; and a new class of combinatorial designs is introduced which permits the construction of hash functions with worst-case behavior ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the complexity of the longest common subsequence problem

    Publication Year: 1974, Page(s):104 - 109
    Cited by:  Papers (20)
    Request permission for commercial reuse | PDF file iconPDF (181 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on selection networks

    Publication Year: 1974, Page(s):110 - 116
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB)

    We investigate the complexity of network selection by measuring it in terms of U(t,N), the minimum number of comparators needed, and T(t,N), the minimum delay time possible, for networks selecting the smallest t elements from a set of N inputs. New bounds on U(t,N) and T(t,N) are presented. In particular, U(3,N) is determined to within a constant of 2, and asymptotic formulae for U(t,N) and T(t,N)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the computational complexity of finding the maxima of a set of vectors

    Publication Year: 1974, Page(s):117 - 121
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Let U1,U2,...,Udbe totally ordered sets and let V be a set of n d-dimensional vectors in U1× U2× ... × Ud. A partial ordering is defined on V in a natural way. We consider the problem of finding all maximal elements of V with respect to the partial ordering. The computational complexity of the problem is defined to be the maximum number of required comparisons of two components and is denoted by C... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On self-organizing sequential search heuristics

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

    We examine a class of heuristics for maintaining a sequential list in approximately optimal order with respect to the average time required to search for a specified element, assuming that we search for each element with a fixed probability independent of previous searches performed. The "move to front" and "transposition" heuristics are shown to be optimal to within a constant factor, and the tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Operations on sparse relations and efficient algorithms for grammar problems

    Publication Year: 1974, Page(s):127 - 132
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB)

    various operations on graphs, matrices, or relations can be executed more quickly when the arguments are "sparse" (i.e., if e ≪ ≪ v2where e is the number of edges and v the number of vertices) than when they are "dense" (i.e., e ≈ v2). Fast algorithms are presented for a large class of operations on sparse relations. These algorithms are used to produce the best known methods for solving a variety... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization of fanout in switching networks

    Publication Year: 1974, Page(s):133 - 139
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The problem of finding the minimum amount of fanout needed to realize a switching function f is investigated. Fanout-free functions are defined, and necessary and sufficient conditions for a function to be fanout-free are derived. A measure τ(f) called the input fanout index, is introduced which represents the minimum number of input variables that fan out in any realization off. It is shown that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinational complexity of some monotone functions

    Publication Year: 1974, Page(s):140 - 144
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    An important open question in the field of computational complexity in the development of nontrivial lower bounds on the number of logical operations required to compute switching functions. Although counting arguments can be used to show that most Boolean functions of n inputs and 0(n) or fewer outputs have complexity growing exponentially in n, no one has yet exhibited a particular such function... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study of models of parallel computation

    Publication Year: 1974, Page(s):145 - 155
    Cited by:  Papers (3)
    Request permission for commercial reuse | PDF file iconPDF (586 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems

    Publication Year: 1974, Page(s):156 - 164
    Cited by:  Papers (24)
    Request permission for commercial reuse | PDF file iconPDF (426 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-complex sequences: Characterizations and examples

    Publication Year: 1974, Page(s):165 - 169
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (365 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two way deterministic pushdown automaton languages and some open problems in the theory of computation

    Publication Year: 1974, Page(s):170 - 177
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB)

    We consider some of the important unsolved problems in the theory of computation concerning the relationship between deterministic and nondeterministic computations, and between tape and time bounded computations. For each such problem we find an equivalent problem concerning two way deterministic pushdown automaton languages. This is the first time many of the open problems have been reduced to q... View full abstract»

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