11. FOCS 1970:
Santa Monica,
California
11th Annual Symposium on Foundations of Computer Science,
Santa Monica, California, October 1970. IEEE Computer Society
- Joseph D. Rutledge:
Program Schemata as Automata: Part I.
7-24
- Alfred V. Aho, Jeffrey D. Ullman:
Equivalence of Programs with Structured Variables.
25-31
- Robert M. Keller:
On Maximally Parallel Schemata.
32-50
- David Gale, Richard M. Karp:
A Phenomenon in the Theory of Sorting.
51-59
- Robert L. Constable, Allan Borodin:
On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract).
60-67
- Edward M. Reingold:
On the Optimality of Some Set and Vector Algorithms.
68-71
- Tiko Kameda:
On the Computational Power of Some Machines with Pushdown-Like Storage.
72
- Mike Paterson:
Tape-Bounds for Time-Bounded Turing Machines.
73-75
- Yechezkel Zalcstein:
On Star-Free Events.
76-80
- Michel Fliess:
Deux applications de la representation matricielle d'une serie rationnelle non commutative.
81-87
- Aaron Ashkinazy:
Fault Detection Experiments for Asynchronous Sequential Machines.
88-96
- Martin A. Fischler, Meyer Tannenbaum:
Synchronizing and Representation Problems for Sequential Machines with Masked Outputs.
97-103
- Jon G. Bredeson, Paul T. Hulina:
Elimination of Static and Dynamic Hazards in Combinatorial Switching Circuits.
104-108
- Gyula Magó:
Asynchronous Sequential Circuits with (2,1) Type State Assignments.
109-113
- Stephen H. Unger:
Asynchronous Sequential Switching Circuits with Unrestricted Input Changes.
114-121
- Dines Bjørner:
The Synthesis of Finite State Syntax Directed Top-Down and Bottom-Up Transducers.
122-132
- David B. Benson:
Syntactic Clues.
133-138
- Daniel J. Rosenkrantz, Philip M. Lewis II:
Deterministic Left Corner Parsing (Extended Abstract).
139-152
- Alexander Birman, Jeffrey D. Ullman:
Parsing Algorithms with Backtrack.
153-174
- Susan L. Graham:
Extended Precedence Languages, Bounded Right Context Languages, and Deterministic Languages (Extended Abstract).
175-180
- Joseph Alphonso Giuliano:
Writing Stack Acceptors.
181-193
- Edwin Roger Banks:
Universality in Cellular Automata.
194-215
- Alvy Ray Smith III:
Cellular Automata and Formal Languages.
216-224
- Arie Shoshani, Edward G. Coffman Jr.:
Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks.
225-235
- Bernard P. Zeigler:
Series-Parallel Irreducibility: Machine Oriented Definitions and Proofs.
236-239
Copyright © Sun Nov 15 04:27:23 2009
by Michael Ley (ley@uni-trier.de)
