Information and Computation, Volume 47

Volume 47, Number 1, 1980

Ken-ichi Kanatani: Generalized Global Sensitivity and Correlation Analysis. 37-58
M. W. Warner: Semi-Group, Group Quotient and Homogeneous Automata. 59-66

Aimo Tietäväinen: Bounds for Binary Codes Just Outside the Plotkin Range. 85-93
Kazuhiko Ozeki: A New Definition of the Entropy of General Probability Distributions Based on the Non-Standard Analysis. 94-106
Klaus-Jörn Lange: Equivalence of Adult Languages and Extensions for DTOL Systems. 107-112
Ryuzo Takiyama: A Relationship between the Cascaded Network and the Two-Layer Network of Threshold Logic Units. 113-121
Amiram Yehudai: The Decidability of Equivalence for a Family of Linear Grammars. 122-136
Andrzej Ehrenfeucht, Grzegorz Rozenberg: On Basic Properties of DOS Systems and Languages. 137-153

Juhani Karhumäki: Generalized Parikh Mappings and Homomorphisms. 155-165
Gheorghe Paun: The Complement of a Finite Index Matrix Language Is Context Sensitive. 166-174
W. Ainhirn: How to Get Rid of Pseudoterminals. 175-194
David M. Mandelbaum: On Completing Decoding of Linear Error-Correcting Codes. 195-200
David Haussler, H. Paul Zeiger: Very Special Languages and Representations of Recursively Enumerable Languages via Computation Histories. 201-212
Prem Nath, Man Mohan Kaur: On Characterizing the Shannon Entropy without Assuming Symmetry. 213-219
Leslie Paul Jones, Jonathan Goldstine: A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages. 220-236
Yasuo Matsuyama: Mismatch Robustness of Linear Prediction and Its Relationship to Coding. 237-262