JCSS, Volume 17

Volume 17, Number 1, August 1978

Yasuyoshi Inagaki, Toshiki Sakabe, Teruo Fukumura: Addressable Approximations to Nonaddressable Data Graphs. 1-34
Anita K. Jones, Richard J. Lipton: The Enforcement of Security Policies for Computation. 35-55
Seth Breidbart: On Splitting Recursive Sets. 56-64
Masami Ito: A Representation of Strongly Connected Automata and its Applications. 65-80
Yaacov Choueka: Finite Automata, Definable Sets, and Regular Expressions over omega^n-Tapes. 81-97
Carlton J. Maxson, Kirby C. Smith: Endomorphisms of Linear Automata. 98-107
William F. McColl: The Circuit Depth of Symmetric Boolean Functions. 108-115
Stephen J. Hegner: Duality Theory for Discrete-Time Linear Systems. 116-143

Nicholas Pippenger: On Rearrangeable and Non-Blocking Switching Networks. 145-162
Karel Culik II, Arto Salomaa: On the Decidability of Homomorphism Equivalence for Languages. 163-175
Ulrich Golze: (A-)Synchronous (Non-)Deterministic Cell Spaces Simulating Each Other. 176-193
Bernd Reusch: Realization of Finite Automata with Linear Parts. 194-206
Suhir Aggarwal: A Note on 'Indecomposable Parallel Maps' by S. Amoroso, and I. J. Epstein. 207-208
Gordon D. Plotkin: T^omega as a Universal Domain. 209-236
Lutz Priese: A Note on Asynchronous Cellular Automata. 237-252
Dan Moore, John Case: The Complexity of Total Order Structures. 253-269
Claudio L. Lucchesi, Sylvia L. Osborn: Candidate Keys for Relations. 270-279

K. N. King, Celia Wrathall: Stack Languages and log n Space. 281-299
Kojiro Kobayashi: The Firing Squad Synchronization Problem for a Class of Polyautomata Networks. 300-318
T. S. E. Maibaum: Pumping Lemmas for Term Languages. 319-330
Andrzej Ehrenfeucht, Grzegorz Rozenberg: On the Structure of Derivations in Deterministic ET0L Systems. 331-347
Robin Milner: A Theory of Type Polymorphism in Programming. 348-375
Tadao Takaoka: A Definition of Measures over Language Space. 376-387
Bruno Courcelle, Irène Guessarian: On Some Classes of Interpretations. 406-431
Moshe Rabinovitz: Closure Properties and Languages Defined by Bilinear Automata. 432-441