Theoretical Computer Science, Volume 101

Volume 101, Number 1, 1992

• Bruno Courcelle: The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures. 3-33
• Erich Grädel: Capturing Complexity Classes by Fragments of Second-Order Logic. 35-57
• Jacques Mazoyer, N. Reimen: A Linear Speed-Up Theorem for Cellular Automata. 59-98
• Pascal Michel: A Survey of Space Complexity. 99-132
• Pierre Péladeau: Formulas, Regular Languages and Boolean Circuits. 133-141
• Michel de Rougemont: The Functional Dimension of Inductive Definitions. 143-158

Volume 101, Number 2, 1992

• Eike Best, Jörg Desel, Javier Esparza: Traps Characterize Home States in Free Choice Systems. 161-176
• Stephen D. Brookes, Shai Geva: Towards a Theory of Parallel Algorithms on Concrete Data Structures. 177-221
• Bard Bloom, Albert R. Meyer: Experimenting with Process Equivalence. 223-237
• Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten: From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic. 239-263
• Jeremy Gunawardena: Causal automata. 265-288
• Jozef Hooman, S. Ramesh, Willem P. de Roever: A Compositional Axiomatization of Statecharts. 289-335
• Shmuel Katz, Doron Peled: Defining Conditional Independence Using Collapses. 337-359