Default Cover Image

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

Oct. 18 1967 to Oct. 20 1967

Texas

Table of Contents

Papers
Table of contentsFreely available from IEEE.pp. 4-6
Papers
ForewordFreely available from IEEE.pp. c3
Papers
Structural equivalence of context-free grammarsFull-text access may be available. Sign in or learn about subscription options.pp. 7-13
Papers
Programmed grammars -- A new device for generating formal languagesFull-text access may be available. Sign in or learn about subscription options.pp. 14-20
Papers
Indexed grammars -- An extension of context free grammarsFull-text access may be available. Sign in or learn about subscription options.pp. 21-31
Papers
An infinite hierarchy of context-free languagesFull-text access may be available. Sign in or learn about subscription options.pp. 32-36
Papers
Two results on one-way stack automataFull-text access may be available. Sign in or learn about subscription options.pp. 37-44
Papers
On the structure of programming languages, or, six languages for turing machinesFull-text access may be available. Sign in or learn about subscription options.pp. 45-54
Papers
Parallel program schemata: A mathematical model for parallel computationFull-text access may be available. Sign in or learn about subscription options.pp. 55-61
Papers
Completely functional asynchronous computational structuresFull-text access may be available. Sign in or learn about subscription options.pp. 62-70
Papers
The general synthesis problem for asynchronous digital networksFull-text access may be available. Sign in or learn about subscription options.pp. 71-82
Papers
A parallel-acting iterative automatonFull-text access may be available. Sign in or learn about subscription options.pp. 83-94
Papers
Synthesis of asynchronous sequential circuits with minimum number of delay elementsFull-text access may be available. Sign in or learn about subscription options.pp. 95-105
Papers
Universal single transition time asynchronous state assignmentsFull-text access may be available. Sign in or learn about subscription options.pp. 106-111
Papers
On the complexity of undecidable problems in automata theoryFull-text access may be available. Sign in or learn about subscription options.pp. 112-116
Papers
Turing machines with several read-write headsFull-text access may be available. Sign in or learn about subscription options.pp. 117-127
Papers
Abstract families of languagesFull-text access may be available. Sign in or learn about subscription options.pp. 128-139
Papers
An approach to a unified theory of automataFull-text access may be available. Sign in or learn about subscription options.pp. 140-147
Papers
Real time counter machinesFull-text access may be available. Sign in or learn about subscription options.pp. 148-154
Papers
Automata on a 2-dimensional tapeFull-text access may be available. Sign in or learn about subscription options.pp. 155-160
Papers
Testing for faults in combinational cellular logic arraysFull-text access may be available. Sign in or learn about subscription options.pp. 161-174
Papers
Two contributions to redundancy theoryFull-text access may be available. Sign in or learn about subscription options.pp. 175-183
Papers
Decomposition of group functions and the synthesis of multirail cascadesFull-text access may be available. Sign in or learn about subscription options.pp. 184-196
Papers
Generation of self-dual and self-complementary dual functionsFull-text access may be available. Sign in or learn about subscription options.pp. 197-209
Papers
A cellular structure for sequential networksFull-text access may be available. Sign in or learn about subscription options.pp. 210-225
Papers
Inverse problems in coding, automata, and continuous systemsFull-text access may be available. Sign in or learn about subscription options.pp. 226-232
Papers
Modular decomposition of synchronous sequential machinesFull-text access may be available. Sign in or learn about subscription options.pp. 233-239
Papers
Memory-span concepts and the synthesis of sequential machines in feedback shift-register formFull-text access may be available. Sign in or learn about subscription options.pp. 240-251
Papers
Generalized state identification problemsFull-text access may be available. Sign in or learn about subscription options.pp. 251-254
Papers
On decompositions of regular eventsFull-text access may be available. Sign in or learn about subscription options.pp. 255-264
Papers
On the star height of regular eventsFull-text access may be available. Sign in or learn about subscription options.pp. 265-279
Papers
Fuzzy star functions, probabilistic automata and their approximation by nonprobabilistic automataFull-text access may be available. Sign in or learn about subscription options.pp. 280-290
Papers
Computation times for finite groups, semigroups and automataFull-text access may be available. Sign in or learn about subscription options.pp. 291-295
Papers
Classes of automata and transitive closureFull-text access may be available. Sign in or learn about subscription options.pp. 296-306
Papers
Irreducible decompositions of transformation graphs by assignment techniquesFull-text access may be available. Sign in or learn about subscription options.pp. 307-313
Papers
On endomorphisms and congruences of automataFull-text access may be available. Sign in or learn about subscription options.pp. 314-321
Papers
On the decomposability of monadic algebras and automataFull-text access may be available. Sign in or learn about subscription options.pp. 322-335
Showing 37 out of 37