1. Home
  2. Proceedings
  3. FOCS
  4. FOCS 1974
Default Cover Image

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

Oct. 14 1974 to Oct. 16 1974

ISSN: 0272-5428

Table of Contents

ForewordFreely available from IEEE.pp. iii-iii
Papers
Table of contentsFreely available from IEEE.pp. c1
Papers
A two-dimensional generating system modeling growth by binary cell divisionFull-text access may be available. Sign in or learn about subscription options.pp. 1-12
by J. W. Carlyle, S. A. Greibach, A. Paz
Papers
On the power of multiplication in random access machinesFull-text access may be available. Sign in or learn about subscription options.pp. 13-23
by Juris Hartmanis, Janos Simon
Papers
The equivalence problem for regular expressions over one letter is elementaryFull-text access may be available. Sign in or learn about subscription options.pp. 24-27
by Jose Lucas Rangel
Papers
P-complete problems and approximate solutionsFull-text access may be available. Sign in or learn about subscription options.pp. 28-32
by Sartaj Sahni, Teofilo Gonzales
Papers
Approximate algorithms for the traveling salesperson problemFull-text access may be available. Sign in or learn about subscription options.pp. 33-42
by D. J. Rosenkrantz, R. E. Stearns, P. M. Lewis
Papers
Relationships between monadic recursion schemes and deterministic context-free languagesFull-text access may be available. Sign in or learn about subscription options.pp. 43-51
by Emily P. Friedman
Papers
Recursive schemes, algebraic trees and deterministic languagesFull-text access may be available. Sign in or learn about subscription options.pp. 52-62
by Bruno Courcelle
Papers
Initial algebra semanticsFull-text access may be available. Sign in or learn about subscription options.pp. 63-77
by J. A. Goguen, J. W. Thatcher
Papers
Axiomatic equivalence of programs with structured variablesFull-text access may be available. Sign in or learn about subscription options.pp. 78-83
by Christoph M. Hoffman, Lawrence H. Landweber
Papers
Ianov schemas augmented by a pushdown memoryFull-text access may be available. Sign in or learn about subscription options.pp. 84-94
by Nobuki Tokura, Tadao Kasami, Shukichi Furuta
Papers
On hash-coding algorithms for partial-match retrievalFull-text access may be available. Sign in or learn about subscription options.pp. 95-103
by Ronald L. Rivest
Papers
Bounds on the complexity of the longest common subsequence problemFull-text access may be available. Sign in or learn about subscription options.pp. 104-109
by A. V. Aho, D. S. Hirschberg, J. D. Ullman
Papers
Bounds on selection networksFull-text access may be available. Sign in or learn about subscription options.pp. 110-116
by Andrew Chi-Chih Yao
Papers
On the computational complexity of finding the maxima of a set of vectorsFull-text access may be available. Sign in or learn about subscription options.pp. 117-121
by H. T. Kung
Papers
On self-organizing sequential search heuristicsFull-text access may be available. Sign in or learn about subscription options.pp. 122-126
by Ronald L. Rivest
Papers
Operations on sparse relations and efficient algorithms for grammar problemsFull-text access may be available. Sign in or learn about subscription options.pp. 127-132
by Harry B. Hunt, Thomas G. Szymanski, Jeffrey D. Ullman
Papers
Minimization of fanout in switching networksFull-text access may be available. Sign in or learn about subscription options.pp. 133-139
by John P. Hayes
Papers
Combinational complexity of some monotone functionsFull-text access may be available. Sign in or learn about subscription options.pp. 140-144
by Edmund A. Lamagna, John E. Savage
Papers
A comparative study of models of parallel computationFull-text access may be available. Sign in or learn about subscription options.pp. 145-155
by R. J. Lipton, L. Snyder, Y. Zalcstein
Papers
The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systemsFull-text access may be available. Sign in or learn about subscription options.pp. 156-164
by Michel Hack
Papers
Non-complex sequences: Characterizations and examplesFull-text access may be available. Sign in or learn about subscription options.pp. 165-169
by Robert P. Daley
Papers
Two way deterministic pushdown automaton languages and some open problems in the theory of computationFull-text access may be available. Sign in or learn about subscription options.pp. 170-177
by Zvi Galil
Papers
"Natural" properties of flowchart complexity measuresFull-text access may be available. Sign in or learn about subscription options.pp. 178-184
by Theodore P. Baker
Papers
Skeletal LR parsingFull-text access may be available. Sign in or learn about subscription options.pp. 185-198
by A. J. Demers
Papers
Characterization of context-free grammatical familiesFull-text access may be available. Sign in or learn about subscription options.pp. 199-204
by Armin Cremers, Seymour Ginsburg
Papers
On Boolean functions having maximal number of subfunction classesFull-text access may be available. Sign in or learn about subscription options.pp. 205-210
by Pawel Kerntopf
Showing 28 out of 28