Theoretical Computer Science, Volume 141

Volume 141, Numbers 1&2, 17 April 1995

• Frédéric Gruau, Jean-Yves Ratajszczak, Gilles Wiber:
  A Neural Compiler. 1-52
  
• Peter Johansen:
  On-line String Matching with Feedback. 53-67
  
• David E. Muller, Paul E. Schupp:
  Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. 69-107
  
• Rodney G. Downey, Michael R. Fellows:
  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. 109-131
  
• Andrew Chi-Chih Yao:
  Algebraic Decision Trees and Euler Characteristics. 133-150
  
• Shyam Kapur, Gianfranco Bilardi:
  Language Learning Without Overgeneralization. 151-162
  
• Alberto Apostolico, Dany Breslauer, Zvi Galil:
  Parallel Detection of all Palindromes in a String. 163-173
  
• Birgit Jenner, Jacobo Torán:
  Computing Functions with Parallel Queries to NP. 175-193
  
• Roberto Gorrieri, Ugo Montanari:
  On the Implementation of Concurrent Calculi in Net Calculi: Two Case Studies. 195-252
  
• Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
  Multi-Pattern Languages. 253-268
  
• Johan Håstad, Alexander A. Razborov, Andrew Chi-Chih Yao:
  On the Shrinkage Exponent for Read-Once Formulae. 269-282
  
• Detlef Sieling, Ingo Wegener:
  Graph Driven BDDs - A New Data Structure for Boolean Functions. 283-310
  
• Yoshihiro Mizoguchi, Yasuo Kawahara:
  Relational Graph Rewritings. 311-328
  
• H. Petersen:
  A Remark on a Paper by Armando B. Matos. 329-330
  
• Véronique Terrier:
  On Real Time One-Way Cellular Array. 331-335
  
• Anders Dessmark, Andrzej Lingas, Anil Maheshwari:
  Multilist Layering: Complexity and Applications. 337-350
  
• Jacques Justin, Giuseppe Pirillo:
  On a Question About Factorization Forests. 351-355