JCSS, Volume 46

Volume 46, Number 1, February 1993

• Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen: Normal and Sinkless Petri Nets. 1-26
• Klaus Jansen: The Interconnection Problem. 27-38
• Wojciech Ziarko: Variable Precision Rough Set Model. 39-59
• Dirk Janssens, M. Lens, Grzegorz Rozenberg: Computation Graphs for Actor Grammars. 60-90
• Toshimasa Watanabe, Akira Nakamura: A Minimum 3-Connectivity Augmentation of a Graph. 91-127

Volume 46, Number 2, April 1993

• András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán: Threshold Circuits of Bounded Depth. 129-154
• Jürgen Dassow, Helmut Jürgensen: Deterministic Soliton Automata with at Most One Cycle. 155-197
• Santosh S. Venkatesh: Directed Drift: A New Linear Threshold Algorithm for Learning Binary Weights On-Line. 198-217
• Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg: Handle-Rewriting Hypergraph Grammars. 218-270

Volume 46, Number 3, June 1993

• Joëlle Cohen, Dominique Perrin, Jean-Eric Pin: On the Expressive Power of Temporal Logic. 271-294
• Mitsunori Ogiwara, Lane A. Hemachandra: A Complexity Theory for Feasible Closure Properties. 295-325
• S. S. Ravi, Errol L. Lloyd: Graph Theoretic Analysis of PLA Folding Heuristics. 326-348
• Judy Goldsmith, Deborah Joseph, Paul Young: A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy. 349-362
• Lane A. Hemachandra, Albrecht Hoene: Collapsing Degrees via Strong Computation. 363-380
• Stephen L. Bloom, Zoltán Ésik: Matrix and Matricial Iteration Theories, Part I. 381-408
• Stephen L. Bloom, Zoltán Ésik: Matrix and Matricial Iteration Theories, Part II. 409-439