default search action
Information and Control, Volume 15
Volume 15, Number 1, 1969
- Satosi Watanabe:
Modified Concepts of Logic, Probability, and Information Based on Generalized Continuous Characteristic Function. 1-21 - Enrique H. Ruspini:
A New Approach to Clustering. 22-32 - Craig K. Rushforth:
Fast Fourier-Hadamard Decoding of Orthogonal Codes. 33-37 - C. L. Chen, Shu Lin:
Further Results on Polynomial Codes. 38-60 - Johanan Schönheim:
Semilinear Codes and Some Combinatorial Applications of Them. 61-66 - Neal Zierler:
Primitive Trinomials Whose Degree is a Mersenne Exponent. 67-69 - L. S. Bobrow, S. Louis Hakimi:
Graph Theoretic Prefix Codes and Their Synchronizing Properties. 70-94 - Kojiro Kobayashi:
Classification of Formal Languages by Functional Binary Transductions. 95-109
Volume 15, Number 2, 1969
- Robert Knast:
Linear Probabilistic Sequential Machines. 111-129 - Herbert J. Reitboeck, T. P. Brody:
A Transformation with Invariance Under Cyclic Permutation for Applications in Pattern Recognition. 130-154 - Peter A. Franaszek:
On Synchronous Variable Lenght Coding for Discrete Noiseless Channels. 155-164 - David J. Sakrison:
The Rate Distortion Function for a Class of Sources. 165-195 - Philippe Delsarte, Jean-Marie Goethals:
Tri-weight Codes and Generalized Hadamard Matrices. 196-206 - Claus-Peter Schnorr:
Errata: "Transformational Classes of Grammars". 207
Volume 15, Number 3, 1969
- Michael K. Masten, Baxter F. Womack:
Adaptive Modeling of Time Variable Systems. 209-225 - Yueh-Hsung Su:
Shift Register Realizations of Asynchronous Sequential Machines. 226-234 - Lorenzo Calabi, W. E. Hartnett:
Some General Results of Coding Theory with Applications to the Study of Codes for the Correction of Synchronization Errors. 235-249 - Masakazu Nasu, Namio Honda:
Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata. 250-273 - Premachandran R. Menon:
On Sequential Machine Decompositions for Reducing the Number of Delay Elements. 274-287 - Hervé Gallaire:
Recognition Time of Context-Free Languages by On-Line Turing Machines. 288-295
Volume 15, Number 4, 1969
- Seymour Ginsburg, Barbara Partee:
A Mathematical Model of Transformational Grammars. 297-334 - Robert Knast:
Continuous-Time Probabilistic Automata. 335-352 - Gabor T. Herman:
The Uniform Halting Problem for Generalized One-State Turing Machines. 353-367
Volume 15, Number 5, 1969
- Ilka Shinahr, Michael Yoeli:
Group Functions and Multi-Valued Cellular Cascades. 369-376 - David K. Chow:
New Balanced-File Organization Schemes. 377-396 - Lalit R. Bahl, Robert T. Chien:
Multiple-Burst-Error Correction by Threshold Decoding. 397-406 - C. L. Chen, W. Wesley Peterson, E. J. Weldon Jr.:
Some Results on Quasi-Cyclic Codes. 407-423 - J. Robert Jump:
A Note on the Iterative Decomposition of Finite Automata. 424-435 - Arthur D. Friedman, Prem R. Menon:
Design of Generalized Double Rank and Multiple Rank Sequential Circuits. 436-451 - Ivan Fris:
Errata: "Grammars with Partial Ordering of the Rules". 452-453
Volume 15, Number 6, 1969
- Jack Sklansky, Neil J. Bershad:
The Dynamics of Time-Varying Threshold Learning. 455-486 - Carl V. Page:
Strong Stability Problems for Probabilistic Sequential Machines. 487-509 - Donald W. Loveland:
A Variant of the Kolmogorov Concept of Complexity. 510-526 - Bush Jones, Oran Brigham:
A Note on the Determination of a Discrete Probability Distribution from Known Marginals. 527-528 - Arto Salomaa:
Probabilistic and Weighted Grammars. 529-544
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-26 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: