default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th SWAT 1972: College Park, Maryland, USA
- 13th Annual Symposium on Switching and Automata Theory, College Park, Maryland, USA, October 25-27, 1972. IEEE Computer Society 1972
Session I
- Barry K. Rosen:
Program Equivalence and Context-Free Grammars. 7-18 - Denis J. Kfoury:
Effective Computability in Algebraic Structures (A Schematology Approach). 19-26 - John C. Cherniavsky, Robert L. Constable:
Representing Program Schemes in Logic. 27-39 - George Tourlakis, John Mylopoulos:
Some Results in Computational Topology. 40-51 - Joseph A. Goguen:
On Homomorphisms, Simulations, Correctness and Subroutines for Programs and Program Schemes. 52-60 - Albert R. Meyer, Robert Moll:
Honest Bounds for Complexity Classes of Recursive Functions. 61-66
Session II
- Luigi Logrippo:
Renamings in Program Schemas (Extended Abstract). 67-70 - John L. Bruno, Edward G. Coffman Jr., W. H. Hosken:
Consistency of Synchronization Nets using P and V Operations. 71-77 - Robert M. Keller:
On the Decomposition of Asynchronous Systems. 78-89 - R. Moenck, Allan Borodin:
Fast Modular Transforms via Division. 90-96 - Ellis Horowitz:
The Efficient Calculation of Powers of Polynomials. 97-104 - Mary Shaw
, Joseph F. Traub:
On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives. 105-107
Session III
- John Mylopoulos:
On the Relation of Graph Grammars and Graph Automata. 108-120 - R. Hossley, Charles Rackoff:
The Emptiness Problem for Automata on Infinite Trees. 121-124 - Albert R. Meyer, Larry J. Stockmeyer:
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space. 125-129 - Sartaj Sahni:
Some Related Problems from Network Flows, Game Theory and Integer Programming. 130-138 - Nathan Friedman:
Some Results on the Effect of Arithmetics on Comparison Problems. 139-143
Session IV
- David S. Johnson:
Fast Allocation Algorithms. 144-154 - C. L. Liu:
Optimal Scheduling on Multi-Processor Computing Systems. 155-160 - Jeffrey D. Ullman:
A Fast Algorithm for the Elimination of Common Subexpressions. 161-176 - Sheldon B. Akers Jr.:
Universal Test Sets for Logic Networks. 177-184 - Kewal K. Saluja, Sudhakar M. Reddy:
Multiple Faults in Reed-Muller Canonic Networks. 185-191 - C. C. Huang, Richard Y. Kain, Larry L. Kinney:
Output Sufficient Modules for Uniform Decomposition of Synchronous Sequential Circuits. 192-199
Session V
- Jean Berstel:
On Sets of Numbers Recognized by Push-Down Automata. 200-206 - Brenda S. Baker, Ronald V. Book:
Reversal-Bounded Multi-Pushdown Machines: Extended Abstract. 207-211 - J. Robert Jump, P. S. Thiagarajan:
On the Equivalence of Asynchronous Control Structures. 212-223 - T. S. E. Maibaum:
The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular Sets. 224-230
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
