Theoretical Computer Science, Volume 5

Volume 5, Number 1, August 1977

Walter A. Burkhard: Non-Uniform Partial-Match File Designs. 1-23
Y. S. Kwong: On Reduction of Asynchronous Systems. 25-50
Laurent Chottin: Etude Syntaxique de Certains Langages Solutions d'Equations avec Operateurs. 51-84
Joost Engelfriet: Iterating Iterated Substitution. 85-100

Arnaldo Mandel, Imre Simon: On Finite Semigroups of Matrices. 101-111
Armin B. Cremers, Thomas N. Hibbard: On the Formal Definiton of Dependencies between the Control and Information Structure of a Data Space. 113-128
Michel Latteux: Produit dans le Cône Rationnel Engendré par D. 129-134
Luigia Carlucci Aiello, Mario Aiello, Richard W. Weyhrauch: Pascal in LCF: Semantics and Examples of Proof. 135-177
Zvi Galil, Nimrod Megiddo: Cyclic Ordering is NP-Complete. 179-182
Gérard Jacob: Un Algorithme Calculant le Cardinal, Fini ou Infini, des Demi-Groupes de Matrices. 183-204
M. D. Atkinson: The Complexity of Group Algebra Computations. 205-209
Juhani Karhumäki: Remarks on Commutative N -Rational Series. 211-217
Christophe Reutenauer: On a Question of S. Eilenberg. 219

Gordon D. Plotkin: LCF Considered as a Programming Language. 223-255
Michael B. Smyth: Effectively given Domains. 257-274
Calvin C. Elgot, Lawrence Snyder: On the Many Facets of Lists. 275-305
Seymour Ginsburg, Edwin H. Spanier: Pushdown Acceptor Forms. 307-320
Horst Luckhardt: A Fundamental Effect in Computations on Real Numbers. 321-324
Christian Choffrut: Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles. 325-337
Grzegorz Rozenberg, Martti Penttonen, Arto Salomaa: Bibliography of L Systems. 339-354