Bulletin of the EATCS, Volume 23

Volume 23, June 1984

• Cristian Calude, Ion Chitescu: A class of nuniversal P Marti-Löf tests. 15-21 BibTeX
• Robert P. Daley, Carl H. Smith: On the complextiy of inductive inference. 22-27 BibTeX
• Alain Finkel: Petri Nets and monogenous FIFO nets. 28-30 BibTeX
• Rusins Freivalds: An answer to an open problem. 31-32 BibTeX
• Juraj Hromkovic: On the power of Yao-Rivest technique. 33-34 BibTeX
• Ivan Korec: Two kinds of processors are sufficient and large operating alphabets are needed for regular trellis automata languages. 35-41 BibTeX
• Kurt Lautenbach, Anastasia Pagnoni: On the various high-level Petri Nets and their invariatnts. 42-58 BibTeX
• Arjen K. Lenstra: Polynomial - time algorithms for the factorization of polynomials. 59-75 BibTeX