Default Cover Image

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

Oct. 13 1971 to Oct. 15 1971

ISSN: 0272-4847

Table of Contents

Papers
Table of contentsFreely available from IEEE.pp. iv-v
Boolean matrix multiplication and transitive closureFull-text access may be available. Sign in or learn about subscription options.pp. 129-131
Papers
ForewordFull-text access may be available. Sign in or learn about subscription options.pp. iii
Papers
High level languages of maximum powerFull-text access may be available. Sign in or learn about subscription options.pp. 1-4
Papers
On classes of program schemataFull-text access may be available. Sign in or learn about subscription options.pp. 5-19
Papers
On the composition of parallel program schemataFull-text access may be available. Sign in or learn about subscription options.pp. 20-23
Papers
Toward a weakly invariant complexity theoryFull-text access may be available. Sign in or learn about subscription options.pp. 24-32
Papers
Effective computation over the real numbersFull-text access may be available. Sign in or learn about subscription options.pp. 33-37
Papers
On the design of easily testable sequential machinesFull-text access may be available. Sign in or learn about subscription options.pp. 38-42
Papers
Universal base functions and modules for realizing arbitrary switching functionsFull-text access may be available. Sign in or learn about subscription options.pp. 43-59
Papers
Synthesis of asynchronous sequential circuits with master-slave subcircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 60-78
Papers
A rectangular logic arrayFull-text access may be available. Sign in or learn about subscription options.pp. 79-90
Papers
Nand cellular arraysFull-text access may be available. Sign in or learn about subscription options.pp. 91-104
Papers
Computation by multi-head finite automataFull-text access may be available. Sign in or learn about subscription options.pp. 105-113
Papers
Depth-first search and linear grajh algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 114-121
Papers
A n5/2 algorithm for maximum matchings in bipartiteFull-text access may be available. Sign in or learn about subscription options.pp. 122-125
Papers
On decreasing the computing time for modular arithmeticFull-text access may be available. Sign in or learn about subscription options.pp. 126-128
Papers
Optimal algorithms for parallel polynomial evaluationFull-text access may be available. Sign in or learn about subscription options.pp. 132-139
Papers
Bounds on the evaluation time for rational polynomialFull-text access may be available. Sign in or learn about subscription options.pp. 140-143
Papers
Two-dimensional formal languages and pattern recognition by cellular automataFull-text access may be available. Sign in or learn about subscription options.pp. 144-152
Papers
LR-regular grammars—An extension of LR(k) grammarsFull-text access may be available. Sign in or learn about subscription options.pp. 153-165
Papers
Characterizations of locally testable eventsFull-text access may be available. Sign in or learn about subscription options.pp. 166-176
Papers
Priority paging algorithms and the extension problemFull-text access may be available. Sign in or learn about subscription options.pp. 177-181
Papers
Time bounds on space computationsFull-text access may be available. Sign in or learn about subscription options.pp. 182-187
Papers
Economy of description by automata, grammars, and formal systemsFull-text access may be available. Sign in or learn about subscription options.pp. 188-191
Papers
Languages for defining sets in arbitrary algebrasFull-text access may be available. Sign in or learn about subscription options.pp. 192-201
Papers
Complete linear proofs of systems of linear inequalitiesFull-text access may be available. Sign in or learn about subscription options.pp. 202-206
Papers
Analysis of sorting algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 207-215
Papers
Computing the maximum and the medianFull-text access may be available. Sign in or learn about subscription options.pp. 216-218
Showing 29 out of 29