JCSS, Volume 18

Volume 18, Number 1, February 1979

• 
  Jon T. Butler:
  Decomposable Maps in General Tessellation Structures. 1-7
• 
  Akihiro Nozaki:
  Equivalence Problem of Non-Deterministic Finite Automata. 8-17
• 
  Eitan M. Gurari, Oscar H. Ibarra:
  Some Decision Problems Concerning Sequential Transducers and Checking Automata. 18-34
• 
  Robert Valette:
  Analysis of Petri Nets by Stepwise Refinements. 35-46
• 
  Akira Maruoka, Masayuki Kimura:
  Injectivity and Surjectivity of Parallel Maps for Cellular Automata. 47-64
• 
  Yves Rouchaleau, Eduardo D. Sontag:
  On the Existence of Minimal Realizations of Linear Dynamical Systems over Noetherian Integral Domains. 65-75
• 
  Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi:
  Linear Algorithms on Recursive Representations of Trees. 76-85
• 
  David P. Dobkin, Richard J. Lipton:
  On the Complexity of Computations under Varying Sets of Primitives. 86-91
• 
  Matti Linna:
  Two Decidability Results for Deterministic Pushdown Automata. 92-107

Volume 18, Number 2, April 1979

Selected papers from

STOC 1977

• 
  Robert Endre Tarjan:
  A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. 110-127
• 
  Gary L. Miller:
  Graph Isomorphism, General Remarks. 128-142
• 
  Larry Carter, Mark N. Wegman:
  Universal Classes of Hash Functions. 143-154
• 
  Dana Angluin, Leslie G. Valiant:
  Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. 155-193
• 
  Michael J. Fischer, Richard E. Ladner:
  Propositional Dynamic Logic of Regular Programs. 194-211

Volume 18, Number 3, June 1979

• 
  Arthur G. Werschulz:
  Optimal Order for Approximation of Derivatives. 213-217
• 
  David A. Poplawski:
  On LL-Regular Grammars. 218-227
• 
  Susanna Ginali:
  Regular Trees and the Free Iterative Theory. 228-242
• 
  Hiroakira Ono, Akira Nakamura:
  Undecidability of the First-Order Arithmetic A[P(x), 2x, x+1]. 243-253
• 
  Emily P. Friedman, Sheila A. Greibach:
  Monadic Recursion Schemes: The Effect of Constants. 254-266
• 
  Gheorghe Paun:
  On the Family of Finite Index Matrix Languages. 267-280
• 
  Elaine J. Weyuker:
  Modifications of the Program Scheme Model. 281-293
• 
  Dan Gordon:
  Complexity Classes of Provable Recursive Functions. 294-303
• 
  Paulo A. S. Veloso, Arthur Gill:
  Some Remarks on Multiple-Entry Finite Automata. 304-306
• 
  Michel Latteux:
  Cônes rationnels commutatifs. 307-333