9th Annual Symposium on Switching and Automata Theory (swat 1968)

15-18 Oct. 1968

Filter Results

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

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

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

    Publication Year: 1968, Page(s): 3
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • Structural simplification and decomposition of asynchronous sequential circuits

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

    In this paper, we extend the partition theory developed by Hartmanis and learns for synchronous sequential circuits to asynchronous sequential circuits. method which utilizes the concept of partition pairs to obtain single transition time asynchronous state assignments with reduced dependence is presented. procedures are also presented for obtaining parallel and serial decompositions of synchronou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A characterization of some asnychronous state assignments

    Publication Year: 1968, Page(s):20 - 27
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    A theorem analogous to the information flow theorems1 of synchronous sequential networks is proven for one class of asynchronous sequential networks. This theorem is then shown to lead to a characterization of the valid state assignments for this class of asynchronous circuits. Namely, necessary and sufficient conditions are determined for when a set of two block partitions will define a critical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for minimizing read only memories for machine control

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

    This paper describes an algorithm for minimizing the storage required of a Read Only Memory that is going to be used as the control element for a digital machine. The technique is based upon the fact that not all sub-commands are required in all words so that bits of the memory may be time shared between subcommands. The algorithm provides a means for determining what sub-commands should share a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a measure of complexity for stochastic sequential machines

    Publication Year: 1968, Page(s):34 - 41
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (707 KB)

    The need for a measure different from the number of states in analyzing stochastic sequential machines is pointed out. Using the decomposition previously demonstrated in association with actual physical realization of stochastic sequential machines4, a particular measure of complexity C(M) for a given machine M is introduced. The computational aspect of C(M) is discussed and an example exhibiting ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Infinite state probabilistic transition tables and chains ergodic properties

    Publication Year: 1968, Page(s):42 - 50
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1129 KB)

    This paper is concerned with infinite state probabilistic transition tables, representing the dynamical behavior of a probabilistic automaton and nonhomogeneous infinite-state Markov chains. Many known theorems are generalized from the finite state case to the infinite state case. A possible application to the problem of computing, approximately, products of infinite state stochastic matrices is o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the hartmanis-stearns problem for a class of tag machines

    Publication Year: 1968, Page(s):51 - 60
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1097 KB)

    An infinite sequence over a finite alphabet is regular if the indices of those positions at which each given symbol occurs in the sequence constitute a set of numbers which in suitable base is recognizable by a finite automaton. A sequence obtained by deleting from a regular sequence all occurrences of certain symbols is semi-regular. Semi-regular sequences are alternatively characterizable as tho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "Tapeless" bounded action machines

    Publication Year: 1968, Page(s):61 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (895 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 computation time of finite functions

    Publication Year: 1968, Page(s):69 - 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (614 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.
  • Output functional computational structures

    Publication Year: 1968, Page(s):76 - 84
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 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.
  • Some formal properties of a class of non-deterministic program schemata

    Publication Year: 1968, Page(s):85 - 98
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1939 KB)

    A program schema consists of operation symbols, predicate symbols and some constant symbols. In this paper we investigate some formal properties of a class of non-deterministic program schemata. In Section I a class of regular program schemata is introduced as a counterpart of Kleene's regular expressions, and we show that any graph schema can be represented by a regular program schema and that tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transformation of program schrmes to standard forms

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

    Program schemes are represented as directed, labeled graphs over some vocabulary. Such schemes are transformed to block form by obtaining a regular expression from the graph and translating it to block form by using a recursive correspondence. A necessary and sufficient condition is given for the transformed graph to be deterministic. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Property grammars and table machines

    Publication Year: 1968, Page(s):106 - 119
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1510 KB)

    The purpose of this paper is to generalize the methods of automata theory to accommodate infinite input alphabets and to propose a method of describing computer languages such as ALGOL-60 with more reliance on grammatical methods and less reliance on semantic constraints. Our chief concern is a natural generalization of a context-free grammar which we call a context-free property grammar. The gene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The position of table languages within the hierarchy of nondeterministic on-line tape-bounded turing machine languages

    Publication Year: 1968, Page(s):120 - 130
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1432 KB)

    Table languages are extensions of finite state languages and context free languages. Table languages have access to a table on each generation step. Table entries are an ordered pair: (attribute,identifier). The collection of attributes comprise a finite set while the collection of identifiers comprise an infinite regular set. An arbitrary table language generator is in "normal form" when it has b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Grammars with macro-like productions

    Publication Year: 1968, Page(s):131 - 142
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1504 KB)

    Two new classes of grammars based on programming macros are studied. Both involve appending arguments to the intermediate symbols of a context-free grammar. They differ only in the order in which nested terms may be expanded: IO is expansion from the inside-out; OI from the outside-in. Both classes, in common with the context-free, have decidable emptiness and derivation problems, and both are clo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automaton analogs of syntax directed translation schemata

    Publication Year: 1968, Page(s):143 - 159
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2190 KB)

    This paper is a compendium of recent results obtained in the area of syntax directed translations. It is shown that there exists an infinite hierarchy of syntax directed translations in terms of the number of variables allowed on the right side of productions of the underlying context free grammar. An automaton for the formal specification of translations, called a pushdown assembler, is introduce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Syntax directed mappings of context Free languages

    Publication Year: 1968, Page(s):160 - 175
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1942 KB)

    A definition of meaning is given for languages that possess a parsing algorithm. This definition leads to consider a class of mappings called syntax directed mappings. The behavior of contextfree languages is studied in relation to the defined class of mappings and it is shown that the translation can be implemented in two passes: first by a nondeterministic push down automaton and then by a two-w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structural equivalance and LL-k grammers

    Publication Year: 1968, Page(s):176 - 186
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1292 KB)

    It has been shown by Lewis and Stearns that LL-k grammars are useful descriptive forms for languages that are to be translated mechanically. The goal of the research reported on here is to develop algorithms for transforming arbitrary context-free grammars into LL-k grammars while retaining the structure imposed on the language by the grammar, if this is possible. A solution is presented for the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal synthesis of arbitrary switching functions with regular arrays of 2-input, 1-output switching elements

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

    Not all switching functions are realizable by a single cascade of 2- input, 1-output switching elements, even if repeated inputs are allowed. However, arrays of such cascades feeding a single collector cascade of AND or OR cells can be used to synthesize any function. This paper is concerned with optimal array realizations of this form. A procedure is given which allows one to generate rather effi... View full abstract»

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

    Publication Year: 1968, Page(s):213 - 234
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1942 KB)

    This paper describes a new approach to the design of combinational logic using large-scale-integrated (LSI) circuit technology. A simple "prototype" logic function of n binary variables is imbedded within an array of at most (n+1) rows and columns. The cells of this array contain 2-input exclusive-OR gates, and its rows are fed by the input variables and logical "1". Its column outputs are first d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault detection in a linear cascade of identical machines

    Publication Year: 1968, Page(s):235 - 243
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1046 KB)

    Many machines can be decomposed into a linear cascade of identical sequential machines. We consider the problem of implementing fault detection experiments for such machines. Cascade equivalence and information lossless properties of cascade machines are studied. Sufficient conditions for efficient testing of these machines are derived. Procedures are presented for testing cascades of arbitrary le... View full abstract»

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

    Publication Year: 1968, Page(s):244 - 256
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1307 KB)

    This paper presents systematic synthesis procedures for Lupanov decoding networks. Decoding networks find applications in computer memories for the selection of a particular item of data addressed by a binary code, in counter circuits, in character-by-character code conversion circuits, in the synthesis of switching functions and also in the theoretical derivations of complexity bounds for arbitra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal connecting networks and the synthesis of canonical sequential circuits

    Publication Year: 1968, Page(s):257 - 268
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1075 KB)

    The problem is treated of finding for a set of identical processing elements an interconnection structure that achieves a certain richness of interelement communication with only a limited number of actual inter-element connections. In graphical terms, this problem is one of finding a universal n-node graph of minimal degree D(n,d) in which every n-node graph of maximum degree d is branchembeddabl... View full abstract»

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