Mathematical Systems Theory, Volume 10

Volume 10, 1976

• Neil D. Jones, Y. Edmund Lien, William T. Laaser: New Problems Complete for Nondeterministic Loc Space. 1-17
• Richard E. Ladner, Nancy A. Lynch: Relativization of Questions About Log Space Computability. 19-32
• Harry B. Hunt III: On the Complexity of Finite, Pushdown, and Stack Automata. 33-52
• F. N. Parr: A Class of Infinite Dimensional Linear Systems. 53-67
• W. J. Padgett: Almost Surely Continuous Solutions of a Nonlinear Stochastic Integral Equation. 69-75
• Wolfgang Hahn: On the Asymptotic Behaviour of Solutions of Differential Equations in a Banach Space. 77-83
• V. Lakshmikantham, S. Leela: On Perturbing Lyapunov Functions. 85-90
• William T. Trotter: A Forbidden Subposet Characterization of an Order-Dimension Inequality. 91-96

Volume 10, 1977

• Peter van Emde Boas, R. Kaas, E. Zijlstra: Design and Implementation of an Efficient Priority Queue. 99-127
• Nicholas Pippenger: Information Theory and the Complexity of Boolean Functions. 129-167
• Shmuel Winograd: Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants. 169-180
• Jerome A. Feldman, Paul C. Shields: Total Complexity and the Inference of Best Programs. 181-191
• Arnold L. Rosenberg: On Storing Ragged Arrays by Hashing. 193-210
• Zvi Galil: Some Open Problems in the Theory of Computation as Questions about Two-Way Deterministic Pushdown Automaton Languages. 211-228
• Ronald V. Book: On Languages With a Certain Prefix Property. 229-237
• Wolfgang J. Paul, Robert Endre Tarjan, James R. Celoni: Space Bounds for a Game on Graphs. 239-251 , Correction: Mathematical Systems Theory 11: 85(1977)
• Meera Blattner, Armin B. Cremers: Observations about Bounded Languages and Developmental Systems. 253-258
• Ernest G. Manes: On the Point Transitivity of Symbolic Flows. 259-261
• Héctor J. Sussmann: Existence and Uniqueness of Minimal Realizations of Nonlinear Systems. 263-284
• Jan M. Gronski: Perturbations of Open Sets of Attainability. 285-287
• Joost Engelfriet: Top-down Tree Transducers with Regular Look-ahead. 289-303
• Stephen Y. Itoga: Comparing Language Operations. 305-321
• Larry J. Stockmeyer: On the Combinational Complexity of Certain Symmetric Boolean Functions. 323-336
• Ytha Y. Yu: Rudimentary Relations and Stack Languages. 337-343
• Sudhir Aggarwal: Deterministic Representation of Probabilistic Systems by Ergodic Machines. 345-361
• Michiel Hazewinkel: Moduli and Canonical Forms for Linear Dynamical Systems II: The Topological Case. 363-385
• Stephen J. Willson: The Growth of Configurations. 387-400