By Topic

8th Annual Symposium on Switching and Automata Theory (SWAT 1967)

18-20 Oct. 1967

Filter Results

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

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

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

    Publication Year: 1967, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Structural equivalence of context-free grammars

    Publication Year: 1967, Page(s):7 - 13
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1019 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.
  • Programmed grammars -- A new device for generating formal languages

    Publication Year: 1967, Page(s):14 - 20
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1046 KB)

    A new form of grammar, which is called a programmed grammar, is defined and some of its properties are described. Programmed grammars are a generalization of phrase structure grammars where each production has a label, a core consisting of an ordinary phrase structure production, and two associated sets of production labels. If a production can be applied to an intermediate string in a derivation,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexed grammars -- An extension of context free grammars

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

    A new type of grammar, called an indexed grammar, is defined. The language generated by an indexed grammar is called an indexed language. The class of indexed languages properly includes the class of context free languages and is a proper subset of the class of context sensitive languages. The closure properties and decidability results for the class of indexed languages are similar to those for t... View full abstract»

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

    Publication Year: 1967, Page(s):32 - 36
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (534 KB)

    By generalizing the notions of a one counter machine and of a finite turn pushdown store automaton, it is possible to define an omega 2-hierarchy of families of context-free languages such that each subfamily is infinite, closed under union, concatenation and closure, homomorphism, intersection with regular sets and inverse homomorphism and reversal. Each subfamily can be characterized in a manner... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two results on one-way stack automata

    Publication Year: 1967, Page(s):37 - 44
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1182 KB)

    A stack automaton is a device with a pushdown list which can be read by its storage head in a read only mode. In this paper, we show two properties of stack automata with a one-way input. (1) If a language is accepted by a nondeterministic one-way stack automaton, then it is accepted by a deterministic linear bounded automaton. (2) If a language, L, is accepted by a deterministic one-way stack aut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the structure of programming languages, or, six languages for turing machines

    Publication Year: 1967, Page(s):45 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB)

    In this paper we report some results of a study on the range of possible structure of programming languages. The main emphasis is on the range of graphical ("topological" or flowchart) and syntactic structure. For the sake of simplicity and precision we rather severely limit the "semantic structure" of the languages--we restrict ourselves to command (instruction) languages for Turing machines. As ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel program schemata: A mathematical model for parallel computation

    Publication Year: 1967, Page(s):55 - 61
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (981 KB)

    In this paper we report some results of a study on the range of possible structure of programming languages. The main emphasis is on the range of graphical ("topological" or flowchart) and syntactic structure. For the sake of simplicity and precision we rather severely limit the "semantic structure" of the languages--we restrict ourselves to command (instruction) languages for Turing machines. As ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completely functional asynchronous computational structures

    Publication Year: 1967, Page(s):62 - 70
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1028 KB)

    The "computational schema" is introduced as a means for describing asynchronous, multiprocess computations. Communication constraints which guarantee determinacy of schema execution are developed, and an effective procedure for determining the equivalence of deterministic schemata is presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The general synthesis problem for asynchronous digital networks

    Publication Year: 1967, Page(s):71 - 82
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1802 KB)

    The notion of behavior is defined for an asynchronous digital network. A necessary and sufficient condition for the existence of a network having a given behavior is that the behavior be regular in a general sense. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel-acting iterative automaton

    Publication Year: 1967, Page(s):83 - 94
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1533 KB)

    deterministic automata are defined in an attempt to capture the essential features of an iterative one-dimensional array of finite-state machines operating under the direction of a central control where at discrete time steps each machine in the chain is receiving the same instruction as each of the other machines. Each machine in the array is also capable of direct communication only with immedia... 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 minimum number of delay elements

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

    In this paper, we present a procedure for realizing any normal mode flow table by an asynchronous sequential circuit with a single pure delay, so that no hazards are present even if several input variables change in a transition. A modification of Unger's single delay realization is also proposed in order to allow several inputs to change in a transition without producing output transients. We als... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal single transition time asynchronous state assignments

    Publication Year: 1967, Page(s):106 - 111
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (685 KB)

    In this paper we consider the problem of deriving general bounds on the number of state variables required to realize an asynchronous flow table as a function of n, the number of states of the flow table for Single Transition Time (STT) assignments in which all variables which must change in a given transition are allowed to change simultaneously in a noncritical race. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of undecidable problems in automata theory

    Publication Year: 1967, Page(s):112 - 116
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    This paper describes some general results about hierarchies of undecidable problems in automata theory, and studies how properties of sets accepted by automata change from decidable to undecidable problems as the memory capacity of the automaton is increased. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Turing machines with several read-write heads

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

    This paper describes some general results about hierarchies of undecidable problems in automata theory, and studies how properties of sets accepted by automata change from decidable to undecidable problems as the memory capacity of the automaton is increased. View full abstract»

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

    Publication Year: 1967, Page(s):128 - 139
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1700 KB)

    The notion of an abstract family of languages (AFL) as a family of sets of words satisfying certain properties common to many types of formal languages is introduced. Operations preserving AFL are then considered. The concept of an abstract family of acceptors (AFA) is also introduced and shown to give rise to an AFL. A necessary and sufficient condition on an AFL is presented in order that the AF... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to a unified theory of automata

    Publication Year: 1967, Page(s):140 - 147
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1011 KB)

    An automaton called the balloon automaton is defined. The balloon automaton comes in four varieties, depending on whether the device is deterministic or nondeterministic, and whether the input head can move in one or two directions. Subsets of the balloon automata of each variety, called closed classes are defined. Almost all the known types of automata are equivalent to some closed class of ballo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real time counter machines

    Publication Year: 1967, Page(s):148 - 154
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1123 KB)

    An automaton called the balloon automaton is defined. The balloon automaton comes in four varieties, depending on whether the device is deterministic or nondeterministic, and whether the input head can move in one or two directions. Subsets of the balloon automata of each variety, called closed classes are defined. Almost all the known types of automata are equivalent to some closed class of ballo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automata on a 2-dimensional tape

    Publication Year: 1967, Page(s):155 - 160
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    This paper explains our approach to the problem of pattern recognition by serial computer. The rudimentary theory of vision presented here lies within the framework of automata theory. Our goal is to classify the types of patterns that can be recognized by an automaton that scans a finite 2-dimensional tape. For example, we would like to know if an automaton can decide whether or not a given patte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing for faults in combinational cellular logic arrays

    Publication Year: 1967, Page(s):161 - 174
    Cited by:  Papers (123)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1850 KB)

    Cellular logic arrays are beginning to take on an increasingly greater importance in digital technology, mainly because of their numerous advantages for the design, manufacture, and use in digital systems employing large-scale integrated semiconductor arrays. Particularly significant among these advantages is the feature of testability. One would naturally expect that the iterative structure and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two contributions to redundancy theory

    Publication Year: 1967, Page(s):175 - 183
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1244 KB)

    By analysing an ideal model of a redundancy scheme, a measure for the reliability improvement produced by a redundancy scheme is found; and it is shown that for real redundancy schemes this measure is effectively independent of the size of system to which the scheme is applied. Other advantages of the measure are that it is relatively easy to evaluate, and has a good sensitivity characteristic. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition of group functions and the synthesis of multirail cascades

    Publication Year: 1967, Page(s):184 - 196
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1842 KB)

    A group function is defined as a mapping from the boolean m-cube, Xm, into a finite group. When m=l, we speak of an elementary group function (or, cell). A group function f into a group H is said to be decomposable over a group G if it can be expressed as a composition of elementary group functions into G. This composition corresponds to a cascade connection of combinational cells realizing the el... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of self-dual and self-complementary dual functions

    Publication Year: 1967, Page(s):197 - 209
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1341 KB)

    Properties of self-dual and self-complementary dual functions are discussed. Necessary and sufficient conditions of selfdual and self-complementary dual functions are obtained in terms of the multithreshold weight threshold vector. In particular self-dual and self-complementary dual functions are shown to be realizable respectively by an odd and even number of effective thresholds only. A threshol... View full abstract»

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