9. SWAT 1968: Schenectady, New York, USA

9th Annual Symposium on Switching and Automata Theory, Schenectady, New York, USA, October 15-18, 1968. IEEE Computer Society 1968

Session I

C. J. Tan, Premachandran R. Menon, Arthur D. Friedman:
Structural Simplification and Decomposition of Asynchronous Sequential Circuits. 7-19
Larry L. Kinney:
A Characterization of Some Asynchronous State Assignments. 20-27
Scott J. Schwartz:
An Algorithm for Minimizing Read Only Memories for Machine Control. 28-33
T. T. Nieh, Jack W. Carlyle:
On a Measure of Complexity for Stochastic Sequential Machines. 34-41
Azaria Paz:
Infinite State Probabilistic Transition Tables and Chains Ergodic Properties. 42-50

Alan Cobham:
On the Hartmanis-Stearns Problem for a Class of TAG Machines. 51-60
Eric G. Wagner:
``Tapeless'' Bounded Action Machines. 61-68
Philip M. Spira:
On the Computation Time of Finite Functions. 69-75
Fred L. Luconi:
Output Functional Computational Structures. 76-84
Takayasu Ito:
Some Formal Properties of a Class of Non-Deterministic Program Schemata. 85-98
Sanat K. Basu:
Transformation of Program Schemes to Standard Forms. 99-105

Richard Edwin Stearns, Philip M. Lewis II:
Property Grammars and Table Machines. 106-119
Gordon Whitney:
The Position of Table Languages within the Hierarchy of Nondeterministic On-Line Tape-Bounded Turing Machine Languages. 120-130
Michael J. Fischer:
Grammars with Macro-Like Productions. 131-142
Alfred V. Aho, Jeffrey D. Ullman:
Automaton Analogs of Syntax Directed Translation Schemata. 143-159
Luigi Petrone:
Syntax Directed Mappings of Context-Free Languages. 160-175
Marvin C. Paull, Stephen H. Unger:
Structural Equivalence and LL-k Grammars. 176-186

C. Dennis Weiss:
Optimal Synthesis of Arbitrary Switching Functions with Regular Arrays of 2-Input, 1-Output Switching Elements. 187-212
Robert J. Lechner:
A Transform Approach to Logic Design. 213-234
Melvin A. Breuer:
Fault Detection in a Linear Cascade of Identical Machines. 235-243
Amar Mukhopadhyay:
Lupanov Decoding Networks. 244-256
William H. Kautz, James Turner:
Universal Connecting Networks and the Synthesis of Canonical Sequential Circuits. 257-268
Alvy Ray Smith III:
Simple Computation-Universal Cellular Spaces and Self-Reproduction. 269-277

Janusz A. Brzozowski:
Regular-Like Expressions for Some Irregular Languages. 278-286
Sheila A. Greibach:
Checking Automata and One-Way Stack Languages (Extended Abstract). 287-291
Seymour Ginsburg, John E. Hopcroft:
Two-Way Balloon Automata and AFL. 292-297
Ronald V. Book:
Grammars with Linear Time Functions. 298-305
Seymour Ginsburg, Edwin H. Spanier:
Derivation-Bounded Languages. 306-314
Mario Schkolnick:
Two-Type Bracketed Grammars. 315-326

Juris Hartmanis, John E. Hopcroft:
Structure of Undecidable Problems in Automata Theory. 327-333
Paul R. Young:
Toward a Theory of Enumerations. 334-350
Albert R. Meyer, Patrick C. Fischer:
On Computational Speed-Up. 351-355
Michael J. Fischer, Arnold L. Rosenberg:
Limited Random Access Turing Machines. 356-367
Gabor T. Herman:
The Uniform Halting Problem for Generalized One State Turing Machines. 368-372
Patrick C. Fischer, Juris Hartmanis, Manuel Blum:
Tape Reversal Complexity Hierarchies. 373-382

Rina S. Cohen:
Transition Graphs and the Star Height Problem. 383-394
David E. Muller:
Use of Multiple Index Matrices in Generalized Automata Theory. 395-404
Raymond T. Yeh:
Structural Equivalence of Automata. 405-412
Jeffrey D. Ullman, Peter Weiner:
Universal Two State Machines: Characterization Theorems and Decomposition Schemes. 413-426
Wayne A. Davis:
The Linearity of Sequential Machines: A Critical Review. 427-430
Thomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn:
Iteratively Realized Sequential Circuits. 431-448

Last update Wed May 22 23:32:48 2013 CET by the DBLP Team —

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