- Varol Akman, Wm. Randolph Franklin: On the question "Is Sigma (between 1 and n) root a1 =< L?". 16-19
- R. Boonyavatana, Giora Slutzki: A generalized Ogden's lema for linear conteext-free languages. 20-25
- Emanuela Fachini, Lorenzo Iania: A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood. 26-29
- Sándor Horváth: Finite, simple generating systems for partial recursive functions. 30-31
- Stéphane Kaplan, Marianne Choquer: On the decidability of quasi-reducibility. 32-33
- John Lawrence: THe non-existence of finite test sets for set-equivalence of finite substitions. 34-36
- Rani Siromoney, Gift Siromoney: A public key cryptosystem that defies cryptoanalysis. 37-43
- Bernhard Thalheim: A responce to the note by M. Y. Vardi. 44