Information and Computation, Volume 39

Volume 39, Number 1, 1978

Yoshiko Takenaka: A Boolean Proof of Richardson's Theorem on Graph Theory. 1-13 BibTeX
Mark Luker: A Family of Languages Having Only Finite-Index Grammars. 14-18 BibTeX
Jørn Justesen: Finite State Predictors for Gaussian Sequences. 35-45 BibTeX
R. K. Arora, Saroj Sharma: Correction of Multiple Errors and Detection of Additive Overflow in Residue Code. 46-54 BibTeX
Satoru Fujishige: Polymatroidal Dependence Structure of a Set of Random Variables. 55-72 BibTeX
Amos Nathan: Plain and Covariant Multivariate Fourier Transforms. 73-81 BibTeX
Peter J. van Otterloo, Jan J. Gerbrands: A Note on a Sampling Theorem for Simply Connected Closed Contours. 87-91 BibTeX
George W. Schultz, Chris P. Tsokos, A. N. V. Rao: Statistical Properties of a Linear Stochastic System. 92-117 BibTeX

William J. Leighton III, Harry H. Tan: Trellis Coding for Degraded Broadcast Channels. 119-134 BibTeX
H. P. Edmundson, Immanuel I. Tung: A Characterization of the Recursiveness off an m-Adic Probabilistic Language. 143-148 BibTeX
Wayne Stahnke: On the Toggle Register Polynomial. 149-157 BibTeX
Raija Leipälä: On Context-Free Matrix Forms. 158-176 BibTeX
Sorin Istrail: Elementary Bounded Languages. 177-191 BibTeX
Leon S. Levy, Aravind K. Joshi: Skeletal Structural Descriptions. 192-211 BibTeX
N. E. Nahi, I. M. Weiss: Bounding Filter: A Simple Solution to Lack of Exact a Priori Statistics. 212-224 BibTeX
Paavo Turakainen: A Note on Noncontext-Free Rational Stochastic Languages. 225-226 BibTeX

Moshe Ben-Bassat: f-Entropies, probability of Error, and Feature Selection. 227-242 BibTeX
Claudio Moraga: Comments on a Method of Karpovsky. 243-246 BibTeX
Benjamin Arazi: The Optimal Burst-Error Correction Capability of the Codes Generated by f(X) = (X^p+1)(X^q+1)/(X+1). 303-314 BibTeX
Janos Aczél, Pl. Kannappan: A Mixed Theory of Information. III. Inset Entropies of Degree Beta. 315-322 BibTeX
Bhu Dev Sharma, Jagdish Mitter, Man Mohan: On Measures of ``Useful'' Information. 323-336 BibTeX
Dana Angluin: On the Complexity of Minimum Inference of Regular Sets. 337-350 BibTeX