Theoretical Computer Science, Volume 31

Volume 31, 1984

Hideki Yamasaki, Masako Takahashi: Generalized Parenthesis Languages and Minimization of their Parenthesis Parts. 1-11
Neelam Soundararajan: Denotational Semantics of CSP. 279-304
Kim B. Bruce, Giuseppe Longo: On Combinatory Algebras and their Expansions. 31-40
Uwe Schöning: Minimal pairs for P. 41-48
Bernd Mahr, Johann A. Makowsky: Characterizing Specification Languages which Admit Initial Semantics. 49-59
Juha Honkala: Bases and Ambiguity of Number Systems. 61-71
David de Frutos-Escrig: A Characterization of Plotkin's Order in Powerdomains, and Some of its Properties. 73-82
Robert de Simone: Langages Infinitaires et Produit de Mixage. 83-100
Ker-I Ko: Reducibilities on Real Numbers. 101-123
David A. Plaisted: New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems. 125-138
Tom Head: Adherences of D0L Languages. 139-149
Mohamed Mezghiche: Une Nouvelle C beta-Réduction dans la Logique Combinatoire. 151-163
Paliath Narendran, Robert McNaughton: The Undecidability of the Preperfectness of Thue Systems. 165-174
Joseph A. Goguen, Rod M. Burstall: Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories. 175-209
Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg: Restrictions on NLC Graph Grammars. 211-223
Keisuke Uchimura: Truncations of Infinite Matrices and Algebraic Series Associated with Some CF Grammars. 227-261
Joseph A. Goguen, Rod M. Burstall: Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories. 263-295
H. Alaiwan: Equivalence of Infinite Behavior of Finite Automata. 297-306
Hideki Yamasaki: Normal Petri Nets. 307-315
Michio Oyamaguchi: Some Results on Subclass Containment Problems for Special Classes of DPDA's Related to Nonsingular Machines. 317-335
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Géraud Sénizergues: Remarques sur les Langages de Parenthèses. 337-349