Information and Computation, Volume 27

Volume 27, Number 1, 1975

Masako Takahashi: Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages. 1-36
Walter J. Savitch: Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines. 37-60
A. N. V. Rao, Chris P. Tsokos: On the Existence, Uniqueness, and Stability Behavior of a Random Solution to a Nonlinear Perturbed Stochastic Integro-Differential Equation. 61-74
Paavo Turakainen: Some Remarks on Multistochastic Automata. 75-86
Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa: A Method for Solving Key Equation for Decoding Goppa Codes. 87-99

H. J. Helgert: Binary Primitive Alternant Codes. 101-108
Seymour Ginsburg, Grzegorz Rozenberg: TOL Schemes and Control Sets. 109-125
Alan S. Willsky: Invertibility of Finite Group Homomorphic Sequential Systems. 126-147
Jim K. Omura: A Lower Bounding Method for Channel and Source Coding Probabilities. 148-177
Ronald E. Prather: A Convenient Cryptomorphic Version of Recursive Function Theory. 178-195

Yoshinori Uesaka: Analog Perceptron: Its Decomposition and Order. 199-217
Gérard Jacob: Sur un Théorème de Shamir. 218-261
Sebastiaan H. von Solms: The Characterization by Automata of Certain Classes of Languages in the Context Sensititve Area. 262-271
Harry H. Tan, K. Yao: Rate Distortion Functions of Countably Infinite Alphabet Memoryless Sources. 272-288

Toshihide Ibaraki: Minimal Representations of Some Classes of Dynamic Programming. 289-328
Vaclav Rajlich: Bounded-Crossing Transducers. 329-335
Munehiro Goto, Teruo Fukumura: Perfect Nonbinary AN Codes with Distance Three. 336-348
Zvi Galil: Functional Schemas with Nested Predicates. 349-368
Azriel Rosenfeld: A Note on Cycle Grammars. 374-377