Information and Computation, Volume 31

Volume 31, Number 1, 1976

• M. Gatto, G. Guardabassi: The Regulator Theory for Finite Automata. 1-16
• Tsun S. Chow: Lower Bounds on the Complexity of 0-1-Valued Recursive Functions. 17-42
• Jean-Marie Goethals: Nonlinear Codes Defined by Quadratic Forms over GF(2). 43-74
• E. S. Bainbridge: Feedback and Generalized Logic. 75-96

Volume 31, Number 2, 1976

• Kenneth Donald Heun, K. Vairavan: The Realization of Consistent Input-Output Sequences by Finite State Machines. 97-106
• Harriet Fell: Detectable Properties of Planar Figures. 107-128
• Bruce Knobe, Kathleen Knobe: A Method for Inferring Context-free Grammars. 129-146
• David L. Milgram: A Region Crossing Problem for Array-Bounded Automata. 147-152
• Toshihide Ibaraki: Finite Automata Having Cost Functions. 153-176
• Azriel Rosenfeld: Some Notes on Finite-State Picture Languages. 177-184
• G. C. Patni, K. C. Jain: On Some Information Measures. 185-192
• Rüdiger Valk: Minimal Machines with Several Initial States are Not Unique. 193-196

Volume 31, Number 3, 1976

• Otto Kolp: A Theory of Cascade Decomposition of Group Functions. 216-230
• K. Kjeldsen: Loop-Free Compositions of Certain Finite Automata. II. 231-257
• Alan J. Lee: Characterization of Bandlimited Functions and Processes. 258-271
• Matti Linna: On omega-Sets Associated with Context-Free Languages. 272-293

Volume 31, Number 4, 1976

• Aivar A. Lorenc: Transformers of Markov Chains. 295-311
• Masaharu Mizumoto, Kokichi Tanaka: Some Properties of Fuzzy Sets of Type 2. 312-340
• G. Robert Redinbo: The Optimum Mean-Square Decoding of General Block Codes. 341-363
• Gabor T. Herman, Arnold Lent: A Computer Implementation of a Bayesian Analysis of Image Reconstruction. 364-384
• Ranan B. Banerji: On an Alternative Representation for a Wide Class of Binary Relations. 385-393