Abstract is missing.
- Structural Simplification and Decomposition of Asynchronous Sequential CircuitsC. J. Tan, Premachandran R. Menon, Arthur D. Friedman. 7-19
- A Characterization of Some Asynchronous State AssignmentsLarry L. Kinney. 20-27
- An Algorithm for Minimizing Read Only Memories for Machine ControlScott J. Schwartz. 28-33
- On a Measure of Complexity for Stochastic Sequential MachinesT. T. Nieh, Jack W. Carlyle. 34-41
- Infinite State Probabilistic Transition Tables and Chains Ergodic PropertiesAzaria Paz. 42-50
- On the Hartmanis-Stearns Problem for a Class of TAG MachinesAlan Cobham. 51-60
- Tapeless Bounded Action MachinesEric G. Wagner. 61-68
- On the Computation Time of Finite FunctionsPhilip M. Spira. 69-75
- Output Functional Computational StructuresFred L. Luconi. 76-84
- Some Formal Properties of a Class of Non-Deterministic Program SchemataTakayasu Ito. 85-98
- Transformation of Program Schemes to Standard FormsSanat K. Basu. 99-105
- Property Grammars and Table MachinesRichard Edwin Stearns, Philip M. Lewis II. 106-119
- The Position of Table Languages within the Hierarchy of Nondeterministic On-Line Tape-Bounded Turing Machine LanguagesGordon Whitney. 120-130
- Grammars with Macro-Like ProductionsMichael J. Fischer. 131-142
- Automaton Analogs of Syntax Directed Translation SchemataAlfred V. Aho, Jeffrey D. Ullman. 143-159
- Syntax Directed Mappings of Context-Free LanguagesLuigi Petrone. 160-175
- Structural Equivalence and LL-k GrammarsMarvin C. Paull, Stephen H. Unger. 176-186
- Optimal Synthesis of Arbitrary Switching Functions with Regular Arrays of 2-Input, 1-Output Switching ElementsC. Dennis Weiss. 187-212
- A Transform Approach to Logic DesignRobert J. Lechner. 213-234
- Fault Detection in a Linear Cascade of Identical MachinesMelvin A. Breuer. 235-243
- Lupanov Decoding NetworksAmar Mukhopadhyay. 244-256
- Universal Connecting Networks and the Synthesis of Canonical Sequential CircuitsWilliam H. Kautz, James Turner. 257-268
- Simple Computation-Universal Cellular Spaces and Self-ReproductionAlvy Ray Smith III. 269-277
- Regular-Like Expressions for Some Irregular LanguagesJanusz A. Brzozowski. 278-286
- Checking Automata and One-Way Stack Languages (Extended Abstract)Sheila A. Greibach. 287-291
- Two-Way Balloon Automata and AFLSeymour Ginsburg, John E. Hopcroft. 292-297
- Grammars with Linear Time FunctionsRonald V. Book. 298-305
- Derivation-Bounded LanguagesSeymour Ginsburg, Edwin H. Spanier. 306-314
- Two-Type Bracketed GrammarsMario Schkolnick. 315-326
- Structure of Undecidable Problems in Automata TheoryJuris Hartmanis, John E. Hopcroft. 327-333
- Toward a Theory of EnumerationsPaul R. Young. 334-350
- On Computational Speed-UpAlbert R. Meyer, Patrick C. Fischer. 351-355
- Limited Random Access Turing MachinesMichael J. Fischer, Arnold L. Rosenberg. 356-367
- The Uniform Halting Problem for Generalized One State Turing MachinesGabor T. Herman. 368-372
- Tape Reversal Complexity HierarchiesPatrick C. Fischer, Juris Hartmanis, Manuel Blum. 373-382
- Transition Graphs and the Star Height ProblemRina S. Cohen. 383-394
- Use of Multiple Index Matrices in Generalized Automata TheoryDavid E. Muller. 395-404
- Structural Equivalence of AutomataRaymond T. Yeh. 405-412
- Universal Two State Machines: Characterization Theorems and Decomposition SchemesJeffrey D. Ullman, Peter Weiner. 413-426
- The Linearity of Sequential Machines: A Critical ReviewWayne A. Davis. 427-430
- Iteratively Realized Sequential CircuitsThomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn. 431-448