1. On computing Boolean connectives of characteristic functions

   • R. Chang
   • J. Kadin

   OriginalPaper Pages: 173 - 198

2. Pumping lemmas for the control language hierarchy

   • M. A. Palis
   • S. M. Shende

   OriginalPaper Pages: 199 - 213

3. Communication complexity of matrix computation over finite fields

   • J. I. Chu
   • G. Schnitger

   OriginalPaper Pages: 215 - 228

4. On closure properties of bounded two-sided error complexity classes

   • K. W. Regan
   • J. S. Royer

   OriginalPaper Pages: 229 - 243

5. Power of interconnections and of nondeterminism in regularY-tree systolic automata

   • E. Fachini
   • J. Gruska
   • D. Parente

   OriginalPaper Pages: 245 - 266

6. Prudence in vacillatory language identification

   • S. Jain
   • A. Sharma

   OriginalPaper Pages: 267 - 279