14. SWAT 1973: Iowa City, Iowa, USA

14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15-17, 1973. IEEE Computer Society 1973

Session I

Peter Weiner:
Linear Pattern Matching Algorithms. 1-11
Tiko Kameda, S. Toida:
Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract). 12-15
Ashok K. Chandra:
Efficient Compilation of Linear Recursive Programs. 16-25
Emily P. Friedman:
Equivalence Problems in Monadic Recursion Schemes. 26-33
J. M. Cadiou, Jean-Jacques Lévy:
Mechanizable Proofs about Parallel Processes. 34-48

C. R. Baugh:
Chow Parameters in Pseudothreshold Logic. 49-55
Jon G. Bredeson:
On Multiple Input Change Hazard-Free Combinatorial Switching Circuits without Feedback. 56-63
Henry Y. H. Chuang, Santanu Das:
Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-Flops. 64-69
Vaughan R. Pratt, Foong Frances Yao:
On Lower Bounds for Computing the i-th Largest Element. 70-81
Philip M. Spira, A. Pan:
On Finding and Updating Shortest Paths and Spanning Trees. 82-84

Sam Savage:
Statistical Indicators of Optimality. 85-91
David P. Dobkin:
On the Optimal Evaluation of a Set of n-Linear Forms. 92-102
Matthew M. Geller, Michael A. Harrison:
Characterizations of LR(0) Languages (Extended Abstract). 103-108
M. Dennis Mickunas, Victor B. Schneider:
On the Ability to Cover LR(k) Grammars with LR(1), SLR(1), and (1,1) Bounded-Context Grammars. 109-121
Thomas G. Szymanski, John H. Williams:
Non-Canonical Parsing. 122-129

Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer:
Refinements of the Nondeterministic Time and Space Hierarchies. 130-137
Ivan Hal Sudborough:
On Tape-Bounded Complexity Classes and Multi-Head Finite Automata. 138-144
William C. Rounds:
Complexity of Recognition in Intermediate-Level Languages. 145-158
William H. Joyner Jr.:
Automatic Theorem-Proving and the Decision Problem. 159-166
Hartmut Ehrig, Michael Pfender, Hans Jürgen Schneider:
Graph-Grammars: An Algebraic Approach. 167-180

Michael Machtey:
A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes. 181-189
Kurt Mehlhorn:
On the Size of Sets of Computable Functions. 190-196
Paul Young:
Optimization among Provably Equivalent Programs (Preliminary Abstract). 197-199
Lenore Blum, Manuel Blum:
Inductive Inference: A Recursion Theoretic Approach. 200-208
John C. Cherniavsky:
The Complexity of Some Non-Classical Logics. 209-213

Last update Sat May 18 09:12:38 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page