Information and Computation, Volume 53

Volume 53, Number 1-2, 1982

Wolfgang J. Paul: On-Line Simulation of k+1 Tapes by k Tapes Requires Nonlinear Time. 1-8 BibTeX
Prem Nath, Man Mohan Kaur: On Some Characterizations of the Shannon Entropy Using Extreme Symmetry and Block Symmetry. 9-20 BibTeX
Ker-I Ko: Some Negative Results on the Computational Complexity of Total Variation and Differentiation. 21-31 BibTeX
Daniel N. Osherson, Michael Stob, Scott Weinstein: Learning Strategies. 32-51 BibTeX
Seppo Sippu: Derivational Complexity of Context-Free Grammars. 52-65 BibTeX
J. Martin Borden: Optimal Asymmetric Error Detecting Codes. 66-73 BibTeX
William M. Kantor: An Exponential Number of Generalized Kerdock Codes. 74-80 BibTeX
Nariyasu Minamide: An Extension of the Entropy Theorem for Parameter Estimation. 81-90 BibTeX
Joseph Sifakis: Global and Local Invariants in Transition Systems. 91-107 BibTeX
George M. Reed, Azriel Rosenfeld: Recognition of Surfaces in Three-Dimensional Digital Images. 108-120 BibTeX
Ulrich Golze, Lutz Priese: Petri Net Implementations by a Universal Cell Space. 121-138 BibTeX

Seppo Sippu, Eljas Soisalon-Soininen: On LL(k) Parsing. 141-164 BibTeX
Daniel J. Lehmann, Saharon Shelah: Reasoning with Time and Chance. 165-198 BibTeX
Kosaburo Hashiguchi: Regular Languages of Star Height One. 199-210 BibTeX
Christos H. Papadimitriou, John N. Tsitsiklis: On the Complexity of Designing Distributed Protocols. 211-218 BibTeX