Information and Computation, Volume 69

Volume 69, Number 1-3, 1986

• Steven Homer, John H. Reif: Arithmetic Theories for Computational Complexity Problems. 1-11 BibTeX
• Robert P. Daley, Carl H. Smith: On the Complexity of Inductive Inference. 12-40 BibTeX
• Gilberto Filé: Machines for Attribute Grammars. 41-124 BibTeX
• Stathis Zachos, Hans Heller: A Decisive Characterization of BPP. 125-135 BibTeX
• Grzegorz Rozenberg, Emo Welzl: Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity. 136-167 BibTeX
• Mikhail J. Atallah, Susanne E. Hambrusch: Solving Tree Problems on a Mesh-Connected Processor Array. 168-187 BibTeX
• Pierre-Louis Curien: Categorical Combinators. 188-254 BibTeX
• Joel I. Seiferas: A Simplified Lower Bound for Context-Free-Language Recognition. 255-260 BibTeX